Recognised as Number

9,990,433

Positive
Odd
Composite
7 digits

9,990,433 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,990,433

Digit count7

Digit sum37

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation163 × 61,291

Distinct prime factors2163, 61,291

Number of divisors4

Sum of divisors σ(n)10,051,888

Aliquot sum61,455sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)9,928,980integers below n that share no factor with it

Carmichael function λ(n)183,870the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,928,980

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 163, 61,291, 9,990,4334 in total

Arithmetic

Previous number9,990,432

Next number9,990,434

Double19,980,866

Half4,995,216.5

Square99,808,751,527,489

Cube997,132,644,949,026,512,737

Square root3,160.764622682≈irrational, shown to 9 decimal places

Cube root215.374742159≈

Negation-9,990,433

Reciprocal1.00095762 × 10^-7≈

Representations

Decimal9,990,433

Binary10011000011100010010000124 bits

Octal46070441

Hexadecimal987121

Base 365Y4O1

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, nine hundred and ninety thousand, four hundred and thirty-three

Ordinalnine million, nine hundred and ninety thousand, four hundred and thirty-third

Scientific notation9.990433 × 10^6

Engineering notation9.990433 × 10^6

In other bases

Ternary200210120022001base 3; the most digit-efficient integer base after e: 15 digits

Quinary10024143213base 5; one hand: 11 digits

Septenary150626425base 7: 9 digits

Nonary20716261base 9; each digit is two ternary digits: 8 digits

Duodecimal3419601base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal328g1dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal46:15:7:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01T11TT010T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1111010011011000101100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100110000111000100100001

Bit length24 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits15within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes398 71 21

Gray code110101000100100110110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100110000111000100100001

64-bit0000000000000000000000000000000000000000100110000111000100100001

One's complement11111111011001111000111011011110at 32 bits, every bit flipped

Bits reversed10000100100011100001100100000000at 32 bits

Rotated left by 100000001001100001110001001000010at 32 bits, wrapping

Shifted left by 11001100001110001001000010= 19,980,866, no wrap

Shifted right by 110011000011100010010000= 4,995,216, discarding the low bit

These bits as a double4.93592973 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,990,457+24

Previous prime9,990,403−30

Distance to nearest prime24

Nearest square below9,985,600

Nearest square above9,991,921

Powers & multiples

9,990,433 to the power 299,808,751,527,489

9,990,433 to the power 3997,132,644,949,026,512,737

9,990,433 to the power 49,961,786,881,476,037,790,722,645,121

9,990,433 to the power 599,522,564,399,665,296,653,682,607,664,127,393

First ten multiples9,990,433, 19,980,866, 29,971,299, 39,961,732, 49,952,165, 59,942,598, 69,933,031, 79,923,464, 89,913,897, 99,904,330

Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 1

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time

Highest value reached29,971,3003× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,990,433 → 29,971,300 → 14,985,650 → 7,492,825 → 22,478,476 → 11,239,238 → 5,619,619 → 16,858,858 → 8,429,429 → 25,288,288 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage999,043,300%

9,990,433% as a decimal99,904.33

9,990,433% of 1009,990,433

9,990,433% of 1,00099,904,330

As a fraction of 1009,990,433/100

Read another way

As seconds115 days, 15 hours and 7 minutes

As bytes9.528 MiB

As a 24-bit colour#987121

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.