Base | Representation |
---|---|
bin | 10110110001001001001100… |
… | …010100110101001010100001 |
3 | 111010112201201221120110110201 |
4 | 112301021030110311022201 |
5 | 101111044213401134001 |
6 | 552544554221225201 |
7 | 30043311351665305 |
oct | 2661111424651241 |
9 | 433481657513421 |
10 | 100134148068001 |
11 | 299a6721102183 |
12 | b292803702201 |
13 | 43b47c0512888 |
14 | 1aa2739175d05 |
15 | b89abb8a5501 |
hex | 5b124c5352a1 |
100134148068001 has 4 divisors (see below), whose sum is σ = 101628687591472. Its totient is φ = 98639608544532.
The previous prime is 100134148067971. The next prime is 100134148068077. The reversal of 100134148068001 is 100860841431001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100134148068001 - 221 = 100134145970849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100134148062001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 747269761635 + ... + 747269761768.
It is an arithmetic number, because the mean of its divisors is an integer number (25407171897868).
Almost surely, 2100134148068001 is an apocalyptic number.
It is an amenable number.
100134148068001 is a deficient number, since it is larger than the sum of its proper divisors (1494539523471).
100134148068001 is an equidigital number, since it uses as much as digits as its factorization.
100134148068001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1494539523470.
The product of its (nonzero) digits is 18432, while the sum is 37.
Adding to 100134148068001 its reverse (100860841431001), we get a palindrome (200994989499002).
The spelling of 100134148068001 in words is "one hundred trillion, one hundred thirty-four billion, one hundred forty-eight million, sixty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •