Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00001000000110010001 |
3 | 10122110212121001200222120 |
4 | 32333112320020012101 |
5 | 113334122132034301 |
6 | 2105120013324453 |
7 | 134264615260614 |
oct | 16772670100621 |
9 | 3573777050876 |
10 | 1030102221201 |
11 | 367955938259 |
12 | 147783196729 |
13 | 761a48a1451 |
14 | 37c002a017b |
15 | 1bbde332e36 |
hex | efd6e08191 |
1030102221201 has 32 divisors (see below), whose sum is σ = 1484993731200. Its totient is φ = 632938406400.
The previous prime is 1030102221191. The next prime is 1030102221209. The reversal of 1030102221201 is 1021222010301.
1030102221201 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1030102221201 - 213 = 1030102213009 is a prime.
It is a super-2 number, since 2×10301022212012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1030102221209) 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, 24867615 + ... + 24909003.
It is an arithmetic number, because the mean of its divisors is an integer number (46406054100).
Almost surely, 21030102221201 is an apocalyptic number.
It is an amenable number.
1030102221201 is a deficient number, since it is larger than the sum of its proper divisors (454891509999).
1030102221201 is a wasteful number, since it uses less digits than its factorization.
1030102221201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53249.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1030102221201 its reverse (1021222010301), we get a palindrome (2051324231502).
The spelling of 1030102221201 in words is "one trillion, thirty billion, one hundred two million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •