Base | Representation |
---|---|
bin | 100001011110010100100… |
… | …100111101101100011101 |
3 | 22010220110212200200210101 |
4 | 201132110210331230131 |
5 | 300142003324034323 |
6 | 4520424320541101 |
7 | 325122404161051 |
oct | 41362444755435 |
9 | 8126425620711 |
10 | 2300300221213 |
11 | 807608562795 |
12 | 311991a81791 |
13 | 138bc063a667 |
14 | 7d499821c61 |
15 | 3ec81be0dad |
hex | 2179493db1d |
2300300221213 has 8 divisors (see below), whose sum is σ = 2373667048160. Its totient is φ = 2227522686480.
The previous prime is 2300300221187. The next prime is 2300300221229. The reversal of 2300300221213 is 3121220030032.
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 2300300221213 - 217 = 2300300090141 is a prime.
It is a super-2 number, since 2×23003002212132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300300221313) 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, 147315123 + ... + 147330736.
It is an arithmetic number, because the mean of its divisors is an integer number (296708381020).
Almost surely, 22300300221213 is an apocalyptic number.
It is an amenable number.
2300300221213 is a deficient number, since it is larger than the sum of its proper divisors (73366826947).
2300300221213 is a wasteful number, since it uses less digits than its factorization.
2300300221213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294646107.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2300300221213 its reverse (3121220030032), we get a palindrome (5421520251245).
The spelling of 2300300221213 in words is "two trillion, three hundred billion, three hundred million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •