Base | Representation |
---|---|
bin | 1001001001111001010101… |
… | …10100000010011111001111 |
3 | 2122021112020000212021120222 |
4 | 10210330222310002133033 |
5 | 10114312224340013403 |
6 | 110452054232301555 |
7 | 4145301434436164 |
oct | 444745264023717 |
9 | 78245200767528 |
10 | 20131230001103 |
11 | 6461674574201 |
12 | 23116982418bb |
13 | b3049cc55370 |
14 | 4d84dcc2606b |
15 | 24d9d5bae338 |
hex | 124f2ad027cf |
20131230001103 has 8 divisors (see below), whose sum is σ = 22208561427696. Its totient is φ = 18129437899200.
The previous prime is 20131230001093. The next prime is 20131230001151. The reversal of 20131230001103 is 30110003213102.
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 20131230001103 - 216 = 20131229935567 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 (20131230001193) 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 7 ways as a sum of consecutive naturals, for example, 18884830613 + ... + 18884831678.
It is an arithmetic number, because the mean of its divisors is an integer number (2776070178462).
Almost surely, 220131230001103 is an apocalyptic number.
20131230001103 is a deficient number, since it is larger than the sum of its proper divisors (2077331426593).
20131230001103 is a wasteful number, since it uses less digits than its factorization.
20131230001103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37769662345.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 20131230001103 its reverse (30110003213102), we get a palindrome (50241233214205).
The spelling of 20131230001103 in words is "twenty trillion, one hundred thirty-one billion, two hundred thirty million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •