Base | Representation |
---|---|
bin | 10110111111010111111010… |
… | …001011000010010100010101 |
3 | 111021000012210200111000222011 |
4 | 112333113322023002110111 |
5 | 101223104410202442323 |
6 | 555014115524104221 |
7 | 30204050112632563 |
oct | 2677277213022425 |
9 | 437005720430864 |
10 | 101112022312213 |
11 | 2a243405679290 |
12 | b41022b835071 |
13 | 4455a90898713 |
14 | 1ad7bc2c64a33 |
15 | ba525094c20d |
hex | 5bf5fa2c2515 |
101112022312213 has 8 divisors (see below), whose sum is σ = 110711050263936. Its totient is φ = 91580832014400.
The previous prime is 101112022312187. The next prime is 101112022312271. The reversal of 101112022312213 is 312213220211101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101112022312213 - 217 = 101112022181141 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 (101112022319213) 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, 16959410356 + ... + 16959416317.
It is an arithmetic number, because the mean of its divisors is an integer number (13838881282992).
Almost surely, 2101112022312213 is an apocalyptic number.
It is an amenable number.
101112022312213 is a deficient number, since it is larger than the sum of its proper divisors (9599027951723).
101112022312213 is a wasteful number, since it uses less digits than its factorization.
101112022312213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33918826955.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 101112022312213 its reverse (312213220211101), we get a palindrome (413325242523314).
The spelling of 101112022312213 in words is "one hundred one trillion, one hundred twelve billion, twenty-two million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •