Recognised as Number
1,475,623
- Positive
- Odd
- Composite
- 7 digits
1,475,623 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 value1,475,623
Digit count7
Digit sum28
Digit product5,040
Multiplicative persistence2times 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 factorisation563 × 2,621
Distinct prime factors2563, 2,621
Number of divisors4
Sum of divisors σ(n)1,478,808
Aliquot sum3,185sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,472,440integers below n that share no factor with it
Carmichael function λ(n)736,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,472,440
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 563, 2,621, 1,475,6234 in total
Arithmetic
Previous number1,475,622
Next number1,475,624
Double2,951,246
Half737,811.5
Square2,177,463,238,129
Cube3,213,114,835,837,629,367
Square root1,214.752238113≈irrational, shown to 9 decimal places
Cube root113.847929996≈
Negation-1,475,623
Reciprocal6.77679868 × 10^-7≈
Representations
Decimal1,475,623
Binary10110100001000010011121 bits
Octal5502047
Hexadecimal168427
Base 36VMLJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-five thousand, six hundred and twenty-three
Ordinalone million, four hundred and seventy-five thousand, six hundred and twenty-third
Scientific notation1.475623 × 10^6
Engineering notation1.475623 × 10^6
In other bases
Ternary2202222011201base 3; the most digit-efficient integer base after e: 13 digits
Quinary334204443base 5; one hand: 9 digits
Septenary15354052base 7: 8 digits
Nonary2688151base 9; each digit is two ternary digits: 7 digits
Duodecimal5b1b47base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal94913base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:49:53:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1000T1TTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111000010001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101000010000100111
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes316 84 27
Gray code111011100011000110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101000010000100111
64-bit0000000000000000000000000000000000000000000101101000010000100111
One's complement11111111111010010111101111011000at 32 bits, every bit flipped
Bits reversed11100100001000010110100000000000at 32 bits
Rotated left by 100000000001011010000100001001110at 32 bits, wrapping
Shifted left by 11011010000100001001110= 2,951,246, no wrap
Shifted right by 110110100001000010011= 737,811, discarding the low bit
These bits as a double7.29054631 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,475,623 to the power 22,177,463,238,129
1,475,623 to the power 33,213,114,835,837,629,367
1,475,623 to the power 44,741,346,153,403,230,159,420,641
1,475,623 to the power 56,996,439,434,923,334,697,534,764,534,343
First ten multiples1,475,623, 2,951,246, 4,426,869, 5,902,492, 7,378,115, 8,853,738, 10,329,361, 11,804,984, 13,280,607, 14,756,230
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached11,205,5207× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,475,623 → 4,426,870 → 2,213,435 → 6,640,306 → 3,320,153 → 9,960,460 → 4,980,230 → 2,490,115 → 7,470,346 → 3,735,173 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,562,300%
1,475,623% as a decimal14,756.23
1,475,623% of 1001,475,623
1,475,623% of 1,00014,756,230
As a fraction of 1001,475,623/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,475,623
Nerdulate something else
Nothing in mind? Surprise me · today’s page