Base | Representation |
---|---|
bin | 100100110000001… |
… | …0111001000000101 |
3 | 10011221112001221120 |
4 | 1021200113020011 |
5 | 10011201020401 |
6 | 322212104153 |
7 | 42363124611 |
oct | 11140271005 |
9 | 3157461846 |
10 | 1233220101 |
11 | 583136573 |
12 | 2a5005059 |
13 | 168656049 |
14 | b9ada341 |
15 | 733ed836 |
hex | 49817205 |
1233220101 has 8 divisors (see below), whose sum is σ = 1688733984. Its totient is φ = 799926480.
The previous prime is 1233220097. The next prime is 1233220123. The reversal of 1233220101 is 1010223321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1233220101 - 22 = 1233220097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1233220501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5554935 + ... + 5555156.
It is an arithmetic number, because the mean of its divisors is an integer number (211091748).
Almost surely, 21233220101 is an apocalyptic number.
It is an amenable number.
1233220101 is a deficient number, since it is larger than the sum of its proper divisors (455513883).
1233220101 is a wasteful number, since it uses less digits than its factorization.
1233220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11110131.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1233220101 is about 35117.2336752199. The cubic root of 1233220101 is about 1072.3754546994.
Adding to 1233220101 its reverse (1010223321), we get a palindrome (2243443422).
It can be divided in two parts, 1233220 and 101, that added together give a palindrome (1233321).
The spelling of 1233220101 in words is "one billion, two hundred thirty-three million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •