Recognised as Number
1,345,033
- Positive
- Odd
- Prime
- 7 digits
1,345,033 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 value1,345,033
Digit count7
Digit sum19
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 factorisation1,345,033
Distinct prime factors11,345,033
Number of divisors2
Sum of divisors σ(n)1,345,034
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,345,032integers below n that share no factor with it
Carmichael function λ(n)1,345,032the 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, 1,345,0332 in total
Arithmetic
Previous number1,345,032
Next number1,345,034
Double2,690,066
Half672,516.5
Square1,809,113,771,089
Cube2,433,317,722,869,150,937
Square root1,159.755577697≈irrational, shown to 9 decimal places
Cube root110.385233313≈
Negation-1,345,033
Reciprocal7.43476182 × 10^-7≈
Representations
Decimal1,345,033
Binary10100100001100000100121 bits
Octal5103011
Hexadecimal148609
Base 36STU1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-five thousand and thirty-three
Ordinalone million, three hundred and forty-five thousand and thirty-third
Scientific notation1.345033 × 10^6
Engineering notation1.345033 × 10^6
In other bases
Ternary2112100001001base 3; the most digit-efficient integer base after e: 13 digits
Quinary321020113base 5; one hand: 9 digits
Septenary14301244base 7: 8 digits
Nonary2470031base 9; each digit is two ternary digits: 7 digits
Duodecimal54a461base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal882bdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:13:37:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT100001001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011001101000011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001000011000001001
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes314 86 09
Gray code111101100010100001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001000011000001001
64-bit0000000000000000000000000000000000000000000101001000011000001001
One's complement11111111111010110111100111110110at 32 bits, every bit flipped
Bits reversed10010000011000010010100000000000at 32 bits
Rotated left by 100000000001010010000110000010010at 32 bits, wrapping
Shifted left by 11010010000110000010010= 2,690,066, no wrap
Shifted right by 110100100001100000100= 672,516, discarding the low bit
These bits as a double6.64534598 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,345,033 to the power 21,809,113,771,089
1,345,033 to the power 32,433,317,722,869,150,937
1,345,033 to the power 43,272,892,636,743,862,692,245,921
1,345,033 to the power 54,402,148,601,877,507,868,539,607,860,393
First ten multiples1,345,033, 2,690,066, 4,035,099, 5,380,132, 6,725,165, 8,070,198, 9,415,231, 10,760,264, 12,105,297, 13,450,330
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached78,620,05658× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,345,033 → 4,035,100 → 2,017,550 → 1,008,775 → 3,026,326 → 1,513,163 → 4,539,490 → 2,269,745 → 6,809,236 → 3,404,618 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,503,300%
1,345,033% as a decimal13,450.33
1,345,033% of 1001,345,033
1,345,033% of 1,00013,450,330
As a fraction of 1001,345,033/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 1,345,033
Nerdulate something else
Nothing in mind? Surprise me · today’s page