Recognised as Number
4,016,437
- Positive
- Odd
- Composite
- 7 digits
4,016,437 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,016,437
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 236,261
Distinct prime factors217, 236,261
Number of divisors4
Sum of divisors σ(n)4,252,716
Aliquot sum236,279sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,780,160integers below n that share no factor with it
Carmichael function λ(n)945,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,780,160
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 236,261, 4,016,4374 in total
Arithmetic
Previous number4,016,436
Next number4,016,438
Double8,032,874
Half2,008,218.5
Square16,131,766,174,969
Cube64,792,222,540,493,965,453
Square root2,004.105037167≈irrational, shown to 9 decimal places
Cube root158.957242303≈
Negation-4,016,437
Reciprocal2.48976892 × 10^-7≈
Representations
Decimal4,016,437
Binary111101010010010011010122 bits
Octal17244465
Hexadecimal3D4935
Base 362E33P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, sixteen thousand, four hundred and thirty-seven
Ordinalfour million, sixteen thousand, four hundred and thirty-seventh
Scientific notation4.016437 × 10^6
Engineering notation4.016437 × 10^6
In other bases
Ternary21120001111221base 3; the most digit-efficient integer base after e: 14 digits
Quinary2012011222base 5; one hand: 10 digits
Septenary46065505base 7: 8 digits
Nonary7501457base 9; each digit is two ternary digits: 7 digits
Duodecimal14183b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15211hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:35:40:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT001TTTT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010101100101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111010100100100110101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33d 49 35
Gray code1000111110110110101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111010100100100110101
64-bit0000000000000000000000000000000000000000001111010100100100110101
One's complement11111111110000101011011011001010at 32 bits, every bit flipped
Bits reversed10101100100100101011110000000000at 32 bits
Rotated left by 100000000011110101001001001101010at 32 bits, wrapping
Shifted left by 111110101001001001101010= 8,032,874, no wrap
Shifted right by 1111101010010010011010= 2,008,218, discarding the low bit
These bits as a double1.98438354 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,016,437 to the power 216,131,766,174,969
4,016,437 to the power 364,792,222,540,493,965,453
4,016,437 to the power 4260,233,879,923,873,961,122,150,961
4,016,437 to the power 51,045,212,983,979,804,560,787,568,639,345,957
First ten multiples4,016,437, 8,032,874, 12,049,311, 16,065,748, 20,082,185, 24,098,622, 28,115,059, 32,131,496, 36,147,933, 40,164,370
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1185the total stopping time
Highest value reached12,049,3123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,016,437 → 12,049,312 → 6,024,656 → 3,012,328 → 1,506,164 → 753,082 → 376,541 → 1,129,624 → 564,812 → 282,406 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage401,643,700%
4,016,437% as a decimal40,164.37
4,016,437% of 1004,016,437
4,016,437% of 1,00040,164,370
As a fraction of 1004,016,437/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,016,437
Nerdulate something else
Nothing in mind? Surprise me · today’s page