Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …1010111100000011111010 |
3 | 1022210111222201022201122202 |
4 | 2103013302022330003322 |
5 | 2311121011434014320 |
6 | 33300305300150202 |
7 | 2062301136406046 |
oct | 223076212740372 |
9 | 38714881281582 |
10 | 10110121001210 |
11 | 324875080a12a |
12 | 11734ab098362 |
13 | 5844c373cc79 |
14 | 26d49240d026 |
15 | 127ec298cb75 |
hex | 931f22bc0fa |
10110121001210 has 16 divisors (see below), whose sum is σ = 18199157220000. Its totient is φ = 4043839640976.
The previous prime is 10110121001117. The next prime is 10110121001221. The reversal of 10110121001210 is 1210012101101.
10110121001210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-4 number, since 4×101101210012104 (a number of 53 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110121001191 and 10110121001200.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25891460 + ... + 26279039.
It is an arithmetic number, because the mean of its divisors is an integer number (1137447326250).
Almost surely, 210110121001210 is an apocalyptic number.
10110121001210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10110121001210 is a deficient number, since it is larger than the sum of its proper divisors (8089036218790).
10110121001210 is a wasteful number, since it uses less digits than its factorization.
10110121001210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52189885.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10110121001210 its reverse (1210012101101), we get a palindrome (11320133102311).
The spelling of 10110121001210 in words is "ten trillion, one hundred ten billion, one hundred twenty-one million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •