Base | Representation |
---|---|
bin | 11110000101001110111010… |
… | …001110111111010000110011 |
3 | 122100102212000022102121222022 |
4 | 132011032322032333100303 |
5 | 114320104423020010003 |
6 | 1145214124042502055 |
7 | 36603301111011536 |
oct | 3605167216772063 |
9 | 570385008377868 |
10 | 132301002110003 |
11 | 391785a367a3a1 |
12 | 12a089a1b0492b |
13 | 58a8c1444384c |
14 | 249558cccaa1d |
15 | 10466bcbd1738 |
hex | 7853ba3bf433 |
132301002110003 has 8 divisors (see below), whose sum is σ = 136999592711040. Its totient is φ = 127629337530240.
The previous prime is 132301002109999. The next prime is 132301002110029. The reversal of 132301002110003 is 300011200103231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132301002110003 - 22 = 132301002109999 is a prime.
It is a super-2 number, since 2×1323010021100032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132301002110083) 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, 6731495318 + ... + 6731514971.
It is an arithmetic number, because the mean of its divisors is an integer number (17124949088880).
Almost surely, 2132301002110003 is an apocalyptic number.
132301002110003 is a deficient number, since it is larger than the sum of its proper divisors (4698590601037).
132301002110003 is a wasteful number, since it uses less digits than its factorization.
132301002110003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13463010637.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132301002110003 its reverse (300011200103231), we get a palindrome (432312202213234).
The spelling of 132301002110003 in words is "one hundred thirty-two trillion, three hundred one billion, two million, one hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •