Recognised as Number
5,444,137
- Positive
- Odd
- Composite
- 7 digits
5,444,137 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 value5,444,137
Digit count7
Digit sum28
Digit product6,720
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 factorisation173 × 31,469
Distinct prime factors2173, 31,469
Number of divisors4
Sum of divisors σ(n)5,475,780
Aliquot sum31,643sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,412,496integers below n that share no factor with it
Carmichael function λ(n)1,353,124the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,412,496
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 173, 31,469, 5,444,1374 in total
Arithmetic
Previous number5,444,136
Next number5,444,138
Double10,888,274
Half2,722,068.5
Square29,638,627,674,769
Cube161,356,749,553,433,879,353
Square root2,333.267451451≈irrational, shown to 9 decimal places
Cube root175.917758149≈
Negation-5,444,137
Reciprocal1.83683842 × 10^-7≈
Representations
Decimal5,444,137
Binary1010011000100100010100123 bits
Octal24611051
Hexadecimal531229
Base 3638OQ1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, four hundred and forty-four thousand, one hundred and thirty-seven
Ordinalfive million, four hundred and forty-four thousand, one hundred and thirty-seventh
Scientific notation5.444137 × 10^6
Engineering notation5.444137 × 10^6
In other bases
Ternary101020120221201base 3; the most digit-efficient integer base after e: 15 digits
Quinary2343203022base 5; one hand: 10 digits
Septenary64163056base 7: 8 digits
Nonary11216851base 9; each digit is two ternary digits: 8 digits
Duodecimal19a6661base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1e0a6hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:12:15:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1011T1TT100TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101110001011001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100110001001000101001
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; 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
Bytes353 12 29
Gray code11110101001101100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100110001001000101001
64-bit0000000000000000000000000000000000000000010100110001001000101001
One's complement11111111101011001110110111010110at 32 bits, every bit flipped
Bits reversed10010100010010001100101000000000at 32 bits
Rotated left by 100000000101001100010010001010010at 32 bits, wrapping
Shifted left by 1101001100010010001010010= 10,888,274, no wrap
Shifted right by 11010011000100100010100= 2,722,068, discarding the low bit
These bits as a double2.68976106 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,444,137 to the power 229,638,627,674,769
5,444,137 to the power 3161,356,749,553,433,879,353
5,444,137 to the power 4878,448,250,443,582,859,639,203,361
5,444,137 to the power 54,782,392,622,825,175,858,727,593,668,144,457
First ten multiples5,444,137, 10,888,274, 16,332,411, 21,776,548, 27,220,685, 32,664,822, 38,108,959, 43,553,096, 48,997,233, 54,441,370
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1126the total stopping time
Highest value reached78,484,12014× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,444,137 → 16,332,412 → 8,166,206 → 4,083,103 → 12,249,310 → 6,124,655 → 18,373,966 → 9,186,983 → 27,560,950 → 13,780,475 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage544,413,700%
5,444,137% as a decimal54,441.37
5,444,137% of 1005,444,137
5,444,137% of 1,00054,441,370
As a fraction of 1005,444,137/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 5,444,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page