Recognised as Number
3,072,373
- Positive
- Odd
- Prime
- 7 digits
3,072,373 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,072,373
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,072,373
Distinct prime factors13,072,373
Number of divisors2
Sum of divisors σ(n)3,072,374
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,072,372integers below n that share no factor with it
Carmichael function λ(n)3,072,372the 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, 3,072,3732 in total
Arithmetic
Previous number3,072,372
Next number3,072,374
Double6,144,746
Half1,536,186.5
Square9,439,475,851,129
Cube29,001,590,739,160,759,117
Square root1,752.818587304≈irrational, shown to 9 decimal places
Cube root145.375530747≈
Negation-3,072,373
Reciprocal3.25481314 × 10^-7≈
Representations
Decimal3,072,373
Binary101110111000010111010122 bits
Octal13560565
Hexadecimal2EE175
Base 361TUNP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seventy-two thousand, three hundred and seventy-three
Ordinalthree million, seventy-two thousand, three hundred and seventy-third
Scientific notation3.072373 × 10^6
Engineering notation3.072373 × 10^6
In other bases
Ternary12210002111121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1241303443base 5; one hand: 10 digits
Septenary35054233base 7: 8 digits
Nonary5702447base 9; each digit is two ternary digits: 7 digits
Duodecimal1041bb1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj40idbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:13:26:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T10010TTTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110010011010110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011101110000101110101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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
Bytes32e e1 75
Gray code1110011001000111001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011101110000101110101
64-bit0000000000000000000000000000000000000000001011101110000101110101
One's complement11111111110100010001111010001010at 32 bits, every bit flipped
Bits reversed10101110100001110111010000000000at 32 bits
Rotated left by 100000000010111011100001011101010at 32 bits, wrapping
Shifted left by 110111011100001011101010= 6,144,746, no wrap
Shifted right by 1101110111000010111010= 1,536,186, discarding the low bit
These bits as a double1.51795395 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,072,373 to the power 29,439,475,851,129
3,072,373 to the power 329,001,590,739,160,759,117
3,072,373 to the power 489,103,704,344,047,558,970,574,641
3,072,373 to the power 5273,759,815,426,634,430,897,101,321,493,093
First ten multiples3,072,373, 6,144,746, 9,217,119, 12,289,492, 15,361,865, 18,434,238, 21,506,611, 24,578,984, 27,651,357, 30,723,730
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached9,217,1203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,072,373 → 9,217,120 → 4,608,560 → 2,304,280 → 1,152,140 → 576,070 → 288,035 → 864,106 → 432,053 → 1,296,160 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage307,237,300%
3,072,373% as a decimal30,723.73
3,072,373% of 1003,072,373
3,072,373% of 1,00030,723,730
As a fraction of 1003,072,373/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 3,072,373
Nerdulate something else
Nothing in mind? Surprise me · today’s page