Recognised as Number
5,375,017
- Positive
- Odd
- Prime
- 7 digits
5,375,017 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,375,017
Digit count7
Digit sum28
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 factorisation5,375,017
Distinct prime factors15,375,017
Number of divisors2
Sum of divisors σ(n)5,375,018
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,375,016integers below n that share no factor with it
Carmichael function λ(n)5,375,016the 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, 5,375,0172 in total
Arithmetic
Previous number5,375,016
Next number5,375,018
Double10,750,034
Half2,687,508.5
Square28,890,807,750,289
Cube155,288,582,801,535,129,913
Square root2,318.408290185≈irrational, shown to 9 decimal places
Cube root175.170087694≈
Negation-5,375,017
Reciprocal1.86045923 × 10^-7≈
Representations
Decimal5,375,017
Binary1010010000001000010100123 bits
Octal24402051
Hexadecimal520429
Base 36377E1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and seventy-five thousand and seventeen
Ordinalfive million, three hundred and seventy-five thousand and seventeenth
Scientific notation5.375017 × 10^6
Engineering notation5.375017 × 10^6
In other bases
Ternary101010002010201base 3; the most digit-efficient integer base after e: 15 digits
Quinary2334000032base 5; one hand: 10 digits
Septenary63454414base 7: 8 digits
Nonary11102121base 9; each digit is two ternary digits: 8 digits
Duodecimal1972661base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1dbhahbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:53:3:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10101001T011T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100000010001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100100000010000101001
Bit length23 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits16within that length
Bit parityodd7 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
Bytes352 04 29
Gray code11110110000011000111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100100000010000101001
64-bit0000000000000000000000000000000000000000010100100000010000101001
One's complement11111111101011011111101111010110at 32 bits, every bit flipped
Bits reversed10010100001000000100101000000000at 32 bits
Rotated left by 100000000101001000000100001010010at 32 bits, wrapping
Shifted left by 1101001000000100001010010= 10,750,034, no wrap
Shifted right by 11010010000001000010100= 2,687,508, discarding the low bit
These bits as a double2.65561125 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,375,017 to the power 228,890,807,750,289
5,375,017 to the power 3155,288,582,801,535,129,913
5,375,017 to the power 4834,678,772,464,158,949,379,583,521
5,375,017 to the power 54,486,412,591,533,986,243,617,400,878,294,857
First ten multiples5,375,017, 10,750,034, 16,125,051, 21,500,068, 26,875,085, 32,250,102, 37,625,119, 43,000,136, 48,375,153, 53,750,170
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1263the total stopping time
Highest value reached61,224,82011× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,375,017 → 16,125,052 → 8,062,526 → 4,031,263 → 12,093,790 → 6,046,895 → 18,140,686 → 9,070,343 → 27,211,030 → 13,605,515 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage537,501,700%
5,375,017% as a decimal53,750.17
5,375,017% of 1005,375,017
5,375,017% of 1,00053,750,170
As a fraction of 1005,375,017/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,375,017
Nerdulate something else
Nothing in mind? Surprise me · today’s page