Base | Representation |
---|---|
bin | 1001001110010010101010… |
… | …1001000101111111111000 |
3 | 1022220111001000020201122210 |
4 | 2103210222221011333320 |
5 | 2312123020044421100 |
6 | 33322434451215120 |
7 | 2064446506640625 |
oct | 223445251057770 |
9 | 38814030221583 |
10 | 10141133201400 |
11 | 325a91534a143 |
12 | 1179504ba74a0 |
13 | 5873c6724396 |
14 | 270b9505d34c |
15 | 128bda3a7c50 |
hex | 9392aa45ff8 |
10141133201400 has 48 divisors (see below), whose sum is σ = 31437512926200. Its totient is φ = 2704302186880.
The previous prime is 10141133201293. The next prime is 10141133201401. The reversal of 10141133201400 is 410233114101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141133201401) 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 11 ways as a sum of consecutive naturals, for example, 8450943735 + ... + 8450944934.
Almost surely, 210141133201400 is an apocalyptic number.
10141133201400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10141133201400 is an abundant number, since it is smaller than the sum of its proper divisors (21296379724800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141133201400 is a wasteful number, since it uses less digits than its factorization.
10141133201400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16901888688 (or 16901888679 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10141133201400 its reverse (410233114101), we get a palindrome (10551366315501).
The spelling of 10141133201400 in words is "ten trillion, one hundred forty-one billion, one hundred thirty-three million, two hundred one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •