Recognised as Number
3,735,333
- Positive
- Odd
- Composite
- 7 digits
3,735,333 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,735,333
Digit count7
Digit sum27
Digit product8,505
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7 × 211 × 281
Distinct prime factors43, 7, 211, 281
Number of divisors24
Sum of divisors σ(n)6,217,536
Aliquot sum2,482,203sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,116,800integers below n that share no factor with it
Carmichael function λ(n)840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,116,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 211, 281, 633, 843, 1,477, 1,899, 1,967, 2,529, 4,431, 5,901, 13,293, 17,703, 59,291, 177,873, 415,037, 533,619, 1,245,111, 3,735,33324 in total
Arithmetic
Previous number3,735,332
Next number3,735,334
Double7,470,666
Half1,867,666.5
Square13,952,712,620,889
Cube52,118,027,892,323,171,037
Square root1,932.700959797≈irrational, shown to 9 decimal places
Cube root155.158810521≈
Negation-3,735,333
Reciprocal2.67713749 × 10^-7≈
Representations
Decimal3,735,333
Binary111000111111110010010122 bits
Octal16177445
Hexadecimal38FF25
Base 3628279
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and thirty-five thousand, three hundred and thirty-three
Ordinalthree million, seven hundred and thirty-five thousand, three hundred and thirty-third
Scientific notation3.735333 × 10^6
Engineering notation3.735333 × 10^6
In other bases
Ternary21000202220200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1424012313base 5; one hand: 10 digits
Septenary43515120base 7: 8 digits
Nonary7022820base 9; each digit is two ternary digits: 7 digits
Duodecimal1301799base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal136i6dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:17:35:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1001T100T1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010000001101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001111111100100101
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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
Bytes338 ff 25
Gray code1001001000000010110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001111111100100101
64-bit0000000000000000000000000000000000000000001110001111111100100101
One's complement11111111110001110000000011011010at 32 bits, every bit flipped
Bits reversed10100100111111110001110000000000at 32 bits
Rotated left by 100000000011100011111111001001010at 32 bits, wrapping
Shifted left by 111100011111111001001010= 7,470,666, no wrap
Shifted right by 1111000111111110010010= 1,867,666, discarding the low bit
These bits as a double1.84549971 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,735,333 to the power 213,952,712,620,889
3,735,333 to the power 352,118,027,892,323,171,037
3,735,333 to the power 4194,678,189,481,115,187,439,150,321
3,735,333 to the power 5727,187,865,549,062,436,442,643,685,991,893
First ten multiples3,735,333, 7,470,666, 11,205,999, 14,941,332, 18,676,665, 22,411,998, 26,147,331, 29,882,664, 33,617,997, 37,353,330
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached11,206,0003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,735,333 → 11,206,000 → 5,603,000 → 2,801,500 → 1,400,750 → 700,375 → 2,101,126 → 1,050,563 → 3,151,690 → 1,575,845 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage373,533,300%
3,735,333% as a decimal37,353.33
3,735,333% of 1003,735,333
3,735,333% of 1,00037,353,330
As a fraction of 1003,735,333/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,735,333
Nerdulate something else
Nothing in mind? Surprise me · today’s page