Base | Representation |
---|---|
bin | 1001000110101111111011… |
… | …10001010100001100111110 |
3 | 2121220012010021102200221012 |
4 | 10203113331301110030332 |
5 | 10111024302113130420 |
6 | 110330252450035222 |
7 | 4134423041624660 |
oct | 443277561241476 |
9 | 77805107380835 |
10 | 20023100130110 |
11 | 641a827027760 |
12 | 22b473b878b12 |
13 | b2322a03098c |
14 | 4d31a2172530 |
15 | 24aca7d73dc5 |
hex | 1235fdc5433e |
20023100130110 has 128 divisors (see below), whose sum is σ = 46494672150528. Its totient is φ = 6025295808000.
The previous prime is 20023100130109. The next prime is 20023100130113. The reversal of 20023100130110 is 1103100132002.
It is a super-3 number, since 3×200231001301103 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20023100130113) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9053024 + ... + 11045516.
It is an arithmetic number, because the mean of its divisors is an integer number (363239626176).
Almost surely, 220023100130110 is an apocalyptic number.
20023100130110 is an abundant number, since it is smaller than the sum of its proper divisors (26471572020418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20023100130110 is a wasteful number, since it uses less digits than its factorization.
20023100130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1992970.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20023100130110 its reverse (1103100132002), we get a palindrome (21126200262112).
The spelling of 20023100130110 in words is "twenty trillion, twenty-three billion, one hundred million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •