Base | Representation |
---|---|
bin | 110000011101010100110010… |
… | …101110010101111111010000 |
3 | 1000221121012122102022110121212 |
4 | 300131110302232111333100 |
5 | 210413240133320014204 |
6 | 2033134344042435252 |
7 | 62614341354310256 |
oct | 6035246256257720 |
9 | 1027535572273555 |
10 | 213121423204304 |
11 | 619a831937566a |
12 | 1baa0439502b28 |
13 | 91bc357c45b84 |
14 | 3a8b1bbdc45d6 |
15 | 1998b9d606c6e |
hex | c1d532b95fd0 |
213121423204304 has 10 divisors (see below), whose sum is σ = 412922757458370. Its totient is φ = 106560711602144.
The previous prime is 213121423204301. The next prime is 213121423204309. The reversal of 213121423204304 is 403402324121312.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 159280755939904 + 53840667264400 = 12620648^2 + 7337620^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213121423204301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660044475119 + ... + 6660044475150.
It is an arithmetic number, because the mean of its divisors is an integer number (41292275745837).
Almost surely, 2213121423204304 is an apocalyptic number.
It is an amenable number.
213121423204304 is a deficient number, since it is larger than the sum of its proper divisors (199801334254066).
213121423204304 is a wasteful number, since it uses less digits than its factorization.
213121423204304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13320088950277 (or 13320088950271 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 213121423204304 its reverse (403402324121312), we get a palindrome (616523747325616).
The spelling of 213121423204304 in words is "two hundred thirteen trillion, one hundred twenty-one billion, four hundred twenty-three million, two hundred four thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •