Base | Representation |
---|---|
bin | 1000010100011101… |
… | …0111010000101101 |
3 | 12202122100101200022 |
4 | 2011013113100231 |
5 | 14033211100023 |
6 | 1005335211525 |
7 | 106225510520 |
oct | 20507272055 |
9 | 5678311608 |
10 | 2233300013 |
11 | a4670439a |
12 | 523b16ba5 |
13 | 2978c06c9 |
14 | 172868bb7 |
15 | d10e87c8 |
hex | 851d742d |
2233300013 has 8 divisors (see below), whose sum is σ = 2702480832. Its totient is φ = 1801653696.
The previous prime is 2233299997. The next prime is 2233300031. The reversal of 2233300013 is 3100033322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2233300013 - 24 = 2233299997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2233299964 and 2233300000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2233300093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9383495 + ... + 9383732.
It is an arithmetic number, because the mean of its divisors is an integer number (337810104).
Almost surely, 22233300013 is an apocalyptic number.
It is an amenable number.
2233300013 is a deficient number, since it is larger than the sum of its proper divisors (469180819).
2233300013 is a wasteful number, since it uses less digits than its factorization.
2233300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18767251.
The product of its (nonzero) digits is 324, while the sum is 17.
The square root of 2233300013 is about 47257.8037259456. The cubic root of 2233300013 is about 1307.1206913987.
Adding to 2233300013 its reverse (3100033322), we get a palindrome (5333333335).
The spelling of 2233300013 in words is "two billion, two hundred thirty-three million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •