Base | Representation |
---|---|
bin | 10111001101110001001011… |
… | …000001011010101100101101 |
3 | 111101111210002122202021210212 |
4 | 113031301023001122230231 |
5 | 101340311300113120323 |
6 | 1001052353053512205 |
7 | 30335366304636332 |
oct | 2715611301325455 |
9 | 441453078667725 |
10 | 102101221223213 |
11 | 2a594980675143 |
12 | b54ba984a2665 |
13 | 44c8147202324 |
14 | 1b2da229b8989 |
15 | bc0d48d15b78 |
hex | 5cdc4b05ab2d |
102101221223213 has 8 divisors (see below), whose sum is σ = 104475812839200. Its totient is φ = 99726636180528.
The previous prime is 102101221223191. The next prime is 102101221223219. The reversal of 102101221223213 is 312322122101201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102101221223213 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102101221223219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45003443 + ... + 47217711.
It is an arithmetic number, because the mean of its divisors is an integer number (13059476604900).
Almost surely, 2102101221223213 is an apocalyptic number.
It is an amenable number.
102101221223213 is a deficient number, since it is larger than the sum of its proper divisors (2374591615987).
102101221223213 is a wasteful number, since it uses less digits than its factorization.
102101221223213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3286651.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 102101221223213 its reverse (312322122101201), we get a palindrome (414423343324414).
The spelling of 102101221223213 in words is "one hundred two trillion, one hundred one billion, two hundred twenty-one million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •