Base | Representation |
---|---|
bin | 10110110101000010110111… |
… | …010100111110110100010011 |
3 | 111011111100201010100201220020 |
4 | 112311002313110332310103 |
5 | 101124442232144221003 |
6 | 553312052010114523 |
7 | 30101551613243055 |
oct | 2665026724766423 |
9 | 434440633321806 |
10 | 100402231242003 |
11 | 29a9a390067729 |
12 | b31676011ba43 |
13 | 4403b74b04012 |
14 | 1ab16cb4658d5 |
15 | b91a5c006d53 |
hex | 5b50b753ed13 |
100402231242003 has 8 divisors (see below), whose sum is σ = 133870233210000. Its totient is φ = 66934525051008.
The previous prime is 100402231241993. The next prime is 100402231242037. The reversal of 100402231242003 is 300242132204001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100402231242003 - 228 = 100401962806547 is a prime.
It is a super-3 number, since 3×1004022312420033 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (100402235242003) 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, 73150978 + ... + 74510871.
It is an arithmetic number, because the mean of its divisors is an integer number (16733779151250).
Almost surely, 2100402231242003 is an apocalyptic number.
100402231242003 is a deficient number, since it is larger than the sum of its proper divisors (33468001967997).
100402231242003 is a wasteful number, since it uses less digits than its factorization.
100402231242003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147888501.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 100402231242003 its reverse (300242132204001), we get a palindrome (400644363446004).
The spelling of 100402231242003 in words is "one hundred trillion, four hundred two billion, two hundred thirty-one million, two hundred forty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •