Base | Representation |
---|---|
bin | 10111000000110111010001… |
… | …110000100111100101000101 |
3 | 111021101000010012102001000122 |
4 | 113000313101300213211011 |
5 | 101231244114404412123 |
6 | 555133133025151325 |
7 | 30214333524526640 |
oct | 2700672160474505 |
9 | 437330105361018 |
10 | 101214423513413 |
11 | 2a282883467391 |
12 | b42804978b545 |
13 | 446262c9c4772 |
14 | 1adcb38b78a57 |
15 | ba7c45898bc8 |
hex | 5c0dd1c27945 |
101214423513413 has 8 divisors (see below), whose sum is σ = 117137849998080. Its totient is φ = 85657052810160.
The previous prime is 101214423513409. The next prime is 101214423513449. The reversal of 101214423513413 is 314315324412101.
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 101214423513413 - 22 = 101214423513409 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 (101214423513473) 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, 91513944758 + ... + 91513945863.
It is an arithmetic number, because the mean of its divisors is an integer number (14642231249760).
Almost surely, 2101214423513413 is an apocalyptic number.
It is an amenable number.
101214423513413 is a deficient number, since it is larger than the sum of its proper divisors (15923426484667).
101214423513413 is an equidigital number, since it uses as much as digits as its factorization.
101214423513413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183027890707.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 101214423513413 its reverse (314315324412101), we get a palindrome (415529747925514).
The spelling of 101214423513413 in words is "one hundred one trillion, two hundred fourteen billion, four hundred twenty-three million, five hundred thirteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •