Recognised as Number
5,373,761
- Positive
- Odd
- Prime
- 7 digits
5,373,761 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,373,761
Digit count7
Digit sum32
Digit product13,230
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,373,761
Distinct prime factors15,373,761
Number of divisors2
Sum of divisors σ(n)5,373,762
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,373,760integers below n that share no factor with it
Carmichael function λ(n)5,373,760the 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,373,7612 in total
Arithmetic
Previous number5,373,760
Next number5,373,762
Double10,747,522
Half2,686,880.5
Square28,877,307,285,121
Cube155,179,747,673,799,110,081
Square root2,318.137398861≈irrational, shown to 9 decimal places
Cube root175.156442419≈
Negation-5,373,761
Reciprocal1.86089407 × 10^-7≈
Representations
Decimal5,373,761
Binary1010001111111110100000123 bits
Octal24377501
Hexadecimal51FF41
Base 36376F5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and seventy-three thousand, seven hundred and sixty-one
Ordinalfive million, three hundred and seventy-three thousand, seven hundred and sixty-first
Scientific notation5.373761 × 10^6
Engineering notation5.373761 × 10^6
In other bases
Ternary101010000102012base 3; the most digit-efficient integer base after e: 15 digits
Quinary2333430021base 5; one hand: 10 digits
Septenary63450641base 7: 8 digits
Nonary11100365base 9; each digit is two ternary digits: 8 digits
Duodecimal1971995base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1dbe81base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:52:42:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10101000011T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100000001101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100011111111101000001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes351 ff 41
Gray code11110010000000011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100011111111101000001
64-bit0000000000000000000000000000000000000000010100011111111101000001
One's complement11111111101011100000000010111110at 32 bits, every bit flipped
Bits reversed10000010111111111000101000000000at 32 bits
Rotated left by 100000000101000111111111010000010at 32 bits, wrapping
Shifted left by 1101000111111111010000010= 10,747,522, no wrap
Shifted right by 11010001111111110100000= 2,686,880, discarding the low bit
These bits as a double2.6549907 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,373,761 to the power 228,877,307,285,121
5,373,761 to the power 3155,179,747,673,799,110,081
5,373,761 to the power 4833,898,876,039,302,379,587,984,641
5,373,761 to the power 54,481,173,258,003,837,594,637,107,932,404,801
First ten multiples5,373,761, 10,747,522, 16,121,283, 21,495,044, 26,868,805, 32,242,566, 37,616,327, 42,990,088, 48,363,849, 53,737,610
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 195the total stopping time
Highest value reached16,121,2843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,373,761 → 16,121,284 → 8,060,642 → 4,030,321 → 12,090,964 → 6,045,482 → 3,022,741 → 9,068,224 → 4,534,112 → 2,267,056 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage537,376,100%
5,373,761% as a decimal53,737.61
5,373,761% of 1005,373,761
5,373,761% of 1,00053,737,610
As a fraction of 1005,373,761/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,373,761
Nerdulate something else
Nothing in mind? Surprise me · today’s page