Recognised as Number
2,355,733
- Positive
- Odd
- Prime
- 7 digits
2,355,733 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 value2,355,733
Digit count7
Digit sum28
Digit product9,450
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,355,733
Distinct prime factors12,355,733
Number of divisors2
Sum of divisors σ(n)2,355,734
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,355,732integers below n that share no factor with it
Carmichael function λ(n)2,355,732the 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, 2,355,7332 in total
Arithmetic
Previous number2,355,732
Next number2,355,734
Double4,711,466
Half1,177,866.5
Square5,549,477,967,289
Cube13,073,088,380,315,617,837
Square root1,534.839731047≈irrational, shown to 9 decimal places
Cube root133.058315769≈
Negation-2,355,733
Reciprocal4.24496324 × 10^-7≈
Representations
Decimal2,355,733
Binary100011111100100001010122 bits
Octal10771025
Hexadecimal23F215
Base 361EHP1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and fifty-five thousand, seven hundred and thirty-three
Ordinaltwo million, three hundred and fifty-five thousand, seven hundred and thirty-third
Scientific notation2.355733 × 10^6
Engineering notation2.355733 × 10^6
In other bases
Ternary11102200110101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1100340413base 5; one hand: 10 digits
Septenary26011012base 7: 8 digits
Nonary4380411base 9; each digit is two ternary digits: 7 digits
Duodecimal957331base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalee96dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:54:22:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11110T00110101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000011011000010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000111111001000010101
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes323 f2 15
Gray code1100100000101100011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000111111001000010101
64-bit0000000000000000000000000000000000000000001000111111001000010101
One's complement11111111110111000000110111101010at 32 bits, every bit flipped
Bits reversed10101000010011111100010000000000at 32 bits
Rotated left by 100000000010001111110010000101010at 32 bits, wrapping
Shifted left by 110001111110010000101010= 4,711,466, no wrap
Shifted right by 1100011111100100001010= 1,177,866, discarding the low bit
These bits as a double1.16388675 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,355,733 to the power 25,549,477,967,289
2,355,733 to the power 313,073,088,380,315,617,837
2,355,733 to the power 430,796,705,709,426,051,354,009,521
2,355,733 to the power 572,548,815,930,983,360,234,334,910,933,893
First ten multiples2,355,733, 4,711,466, 7,067,199, 9,422,932, 11,778,665, 14,134,398, 16,490,131, 18,845,864, 21,201,597, 23,557,330
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 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached7,067,2003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,355,733 → 7,067,200 → 3,533,600 → 1,766,800 → 883,400 → 441,700 → 220,850 → 110,425 → 331,276 → 165,638 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage235,573,300%
2,355,733% as a decimal23,557.33
2,355,733% of 1002,355,733
2,355,733% of 1,00023,557,330
As a fraction of 1002,355,733/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 2,355,733
Nerdulate something else
Nothing in mind? Surprise me · today’s page