Base | Representation |
---|---|
bin | 1011000001100110011010… |
… | …1110001101111110011010 |
3 | 1120220212022110110211010222 |
4 | 2300121212232031332122 |
5 | 3042102101000214320 |
6 | 41440454153040042 |
7 | 2360536314155321 |
oct | 260314656157632 |
9 | 46825273424128 |
10 | 12122121101210 |
11 | 3953a6537a72a |
12 | 14394219b6022 |
13 | 69c15a172513 |
14 | 2dc9dc9050b8 |
15 | 1604ce20a825 |
hex | b0666b8df9a |
12122121101210 has 32 divisors (see below), whose sum is σ = 23105488719312. Its totient is φ = 4563196968960.
The previous prime is 12122121101197. The next prime is 12122121101219. The reversal of 12122121101210 is 1210112122121.
It can be written as a sum of positive squares in 8 ways, for example, as 10541586861961 + 1580534239249 = 3246781^2 + 1257193^2 .
It is a super-4 number, since 4×121221211012104 (a number of 53 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12122121101219) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1487651 + ... + 5143670.
Almost surely, 212122121101210 is an apocalyptic number.
12122121101210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12122121101210 is a deficient number, since it is larger than the sum of its proper divisors (10983367618102).
12122121101210 is a wasteful number, since it uses less digits than its factorization.
12122121101210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6642098.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12122121101210 its reverse (1210112122121), we get a palindrome (13332233223331).
The spelling of 12122121101210 in words is "twelve trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •