Recognised as Number
4,635,971
- Positive
- Odd
- Prime
- 7 digits
4,635,971 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,635,971
Digit count7
Digit sum35
Digit product22,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,635,971
Distinct prime factors14,635,971
Number of divisors2
Sum of divisors σ(n)4,635,972
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,635,970integers below n that share no factor with it
Carmichael function λ(n)4,635,970the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,635,9712 in total
Arithmetic
Previous number4,635,970
Next number4,635,972
Double9,271,942
Half2,317,985.5
Square21,492,227,112,841
Cube99,637,341,620,544,603,611
Square root2,153.130511604≈irrational, shown to 9 decimal places
Cube root166.742728394≈
Negation-4,635,971
Reciprocal2.15704542 × 10^-7≈
Representations
Decimal4,635,971
Binary1000110101111010100001123 bits
Octal21536503
Hexadecimal46BD43
Base 362RD4Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and thirty-five thousand, nine hundred and seventy-one
Ordinalfour million, six hundred and thirty-five thousand, nine hundred and seventy-first
Scientific notation4.635971 × 10^6
Engineering notation4.635971 × 10^6
In other bases
Ternary22201112100122base 3; the most digit-efficient integer base after e: 14 digits
Quinary2141322341base 5; one hand: 10 digits
Septenary54255644base 7: 8 digits
Nonary8645318base 9; each digit is two ternary digits: 7 digits
Duodecimal1676a2bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal18j9ibbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:27:46:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1TTTT101T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110111100110101000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001101011110101000011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes346 bd 43
Gray code11001011110001111100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001101011110101000011
64-bit0000000000000000000000000000000000000000010001101011110101000011
One's complement11111111101110010100001010111100at 32 bits, every bit flipped
Bits reversed11000010101111010110001000000000at 32 bits
Rotated left by 100000000100011010111101010000110at 32 bits, wrapping
Shifted left by 1100011010111101010000110= 9,271,942, no wrap
Shifted right by 11000110101111010100001= 2,317,985, discarding the low bit
These bits as a double2.29047401 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,635,971 to the power 221,492,227,112,841
4,635,971 to the power 399,637,341,620,544,603,611
4,635,971 to the power 4461,915,826,269,937,786,547,091,281
4,635,971 to the power 52,141,428,375,028,469,750,236,505,313,068,851
First ten multiples4,635,971, 9,271,942, 13,907,913, 18,543,884, 23,179,855, 27,815,826, 32,451,797, 37,087,768, 41,723,739, 46,359,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 148the total stopping time
Highest value reached20,861,8724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,635,971 → 13,907,914 → 6,953,957 → 20,861,872 → 10,430,936 → 5,215,468 → 2,607,734 → 1,303,867 → 3,911,602 → 1,955,801 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage463,597,100%
4,635,971% as a decimal46,359.71
4,635,971% of 1004,635,971
4,635,971% of 1,00046,359,710
As a fraction of 1004,635,971/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 4,635,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page