Base | Representation |
---|---|
bin | 10110110001000101010110… |
… | …010110001100110110001101 |
3 | 111010112100002100012110202101 |
4 | 112301011112112030312031 |
5 | 101111012240413411023 |
6 | 552543032520555101 |
7 | 30043104161316433 |
oct | 2661052626146615 |
9 | 433470070173671 |
10 | 100130021232013 |
11 | 299a49a3668223 |
12 | b291a51622a91 |
13 | 43b42b35428a6 |
14 | 1aa2467046d53 |
15 | b899294291ad |
hex | 5b115658cd8d |
100130021232013 has 16 divisors (see below), whose sum is σ = 100715702802624. Its totient is φ = 99545709276160.
The previous prime is 100130021231969. The next prime is 100130021232029. The reversal of 100130021232013 is 310232120031001.
It is a cyclic number.
It is not a de Polignac number, because 100130021232013 - 29 = 100130021231501 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 (100130021236013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 452125278 + ... + 452346688.
It is an arithmetic number, because the mean of its divisors is an integer number (6294731425164).
Almost surely, 2100130021232013 is an apocalyptic number.
It is an amenable number.
100130021232013 is a deficient number, since it is larger than the sum of its proper divisors (585681570611).
100130021232013 is a wasteful number, since it uses less digits than its factorization.
100130021232013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224492.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 100130021232013 its reverse (310232120031001), we get a palindrome (410362141263014).
The spelling of 100130021232013 in words is "one hundred trillion, one hundred thirty billion, twenty-one million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •