Base | Representation |
---|---|
bin | 10001101001101101000… |
… | …010011001100111001010 |
3 | 11021221222202112211212122 |
4 | 101221231002121213022 |
5 | 124333221042420320 |
6 | 2325125452411242 |
7 | 153431343632264 |
oct | 21515502314712 |
9 | 4257882484778 |
10 | 1213010123210 |
11 | 428486656236 |
12 | 17710a776b22 |
13 | 8a503ac2372 |
14 | 429d236ab34 |
15 | 21846e8bd25 |
hex | 11a6d0999ca |
1213010123210 has 8 divisors (see below), whose sum is σ = 2183418221796. Its totient is φ = 485204049280.
The previous prime is 1213010123189. The next prime is 1213010123231. The reversal of 1213010123210 is 123210103121.
It is an interprime number because it is at equal distance from previous prime (1213010123189) and next prime (1213010123231).
It can be written as a sum of positive squares in 2 ways, for example, as 1090414204441 + 122595918769 = 1044229^2 + 350137^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60650506151 + ... + 60650506170.
Almost surely, 21213010123210 is an apocalyptic number.
1213010123210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1213010123210 is a deficient number, since it is larger than the sum of its proper divisors (970408098586).
1213010123210 is a wasteful number, since it uses less digits than its factorization.
1213010123210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121301012328.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1213010123210 its reverse (123210103121), we get a palindrome (1336220226331).
The spelling of 1213010123210 in words is "one trillion, two hundred thirteen billion, ten million, one hundred twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •