Base | Representation |
---|---|
bin | 1001001110011011010000… |
… | …1101001001001100111100 |
3 | 1022220200222212000122220221 |
4 | 2103212310031021030330 |
5 | 2312142231412132200 |
6 | 33323455454151124 |
7 | 2064560633004412 |
oct | 223466415111474 |
9 | 38820885018827 |
10 | 10143441130300 |
11 | 326089a0962a5 |
12 | 1179a49ab24a4 |
13 | 5876a391449a |
14 | 270d337932b2 |
15 | 128cc2ce391a |
hex | 939b434933c |
10143441130300 has 36 divisors (see below), whose sum is σ = 22276463261976. Its totient is φ = 4008492395200.
The previous prime is 10143441130261. The next prime is 10143441130367. The reversal of 10143441130300 is 303114434101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 611042371 + ... + 611058970.
It is an arithmetic number, because the mean of its divisors is an integer number (618790646166).
Almost surely, 210143441130300 is an apocalyptic number.
10143441130300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10143441130300 is an abundant number, since it is smaller than the sum of its proper divisors (12133022131676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10143441130300 is a wasteful number, since it uses less digits than its factorization.
10143441130300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1222101438 (or 1222101431 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10143441130300 its reverse (303114434101), we get a palindrome (10446555564401).
The spelling of 10143441130300 in words is "ten trillion, one hundred forty-three billion, four hundred forty-one million, one hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •