Base | Representation |
---|---|
bin | 1001001101001000011110… |
… | …1111000001101011110001 |
3 | 1022211120122020102111200220 |
4 | 2103102013233001223301 |
5 | 2311311224332414301 |
6 | 33305342510403253 |
7 | 2063143162142514 |
oct | 223220757015361 |
9 | 38746566374626 |
10 | 10121220201201 |
11 | 3252426a4238a |
12 | 1175688200529 |
13 | 58557208ac25 |
14 | 26dc26542d7b |
15 | 1284220c4936 |
hex | 93487bc1af1 |
10121220201201 has 32 divisors (see below), whose sum is σ = 13608412339200. Its totient is φ = 6691068094464.
The previous prime is 10121220201143. The next prime is 10121220201203. The reversal of 10121220201201 is 10210202212101.
10121220201201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10121220201201 - 210 = 10121220200177 is a prime.
It is a super-2 number, since 2×101212202012012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10121220201203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141863200 + ... + 141934526.
It is an arithmetic number, because the mean of its divisors is an integer number (425262885600).
Almost surely, 210121220201201 is an apocalyptic number.
It is an amenable number.
10121220201201 is a deficient number, since it is larger than the sum of its proper divisors (3487192137999).
10121220201201 is a wasteful number, since it uses less digits than its factorization.
10121220201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72425.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10121220201201 its reverse (10210202212101), we get a palindrome (20331422413302).
The spelling of 10121220201201 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •