Base | Representation |
---|---|
bin | 10111001110000010101011… |
… | …000011000000100001100101 |
3 | 111101120120121020010212022002 |
4 | 113032002223003000201211 |
5 | 101341113241100402323 |
6 | 1001105141432015045 |
7 | 30336633045641411 |
oct | 2716025303004145 |
9 | 441516536125262 |
10 | 102120012122213 |
11 | 2a5a1943641738 |
12 | b553661531485 |
13 | 44c9b5024a187 |
14 | 1b308c6481d41 |
15 | bc1598849828 |
hex | 5ce0ab0c0865 |
102120012122213 has 16 divisors (see below), whose sum is σ = 103150817827200. Its totient is φ = 101089970818560.
The previous prime is 102120012122207. The next prime is 102120012122243. The reversal of 102120012122213 is 312221210021201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102120012122213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120012122243) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4400006153 + ... + 4400029361.
It is an arithmetic number, because the mean of its divisors is an integer number (6446926114200).
Almost surely, 2102120012122213 is an apocalyptic number.
It is an amenable number.
102120012122213 is a deficient number, since it is larger than the sum of its proper divisors (1030805704987).
102120012122213 is a wasteful number, since it uses less digits than its factorization.
102120012122213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37772.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 102120012122213 its reverse (312221210021201), we get a palindrome (414341222143414).
The spelling of 102120012122213 in words is "one hundred two trillion, one hundred twenty billion, twelve million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •