Base | Representation |
---|---|
bin | 1001001101111100010011… |
… | …1000111010010100010100 |
3 | 1022212220112201020121121210 |
4 | 2103133010320322110110 |
5 | 2312023222030321112 |
6 | 33320003121341420 |
7 | 2064144665650140 |
oct | 223370470722424 |
9 | 38786481217553 |
10 | 10135131104532 |
11 | 3258315316a05 |
12 | 117830aa97870 |
13 | 58697b0a3085 |
14 | 270785c66220 |
15 | 1289884a8b3c |
hex | 937c4e3a514 |
10135131104532 has 24 divisors (see below), whose sum is σ = 27027016278976. Its totient is φ = 2895751744128.
The previous prime is 10135131104521. The next prime is 10135131104533. The reversal of 10135131104532 is 23540113153101.
It is a self number, because there is not a number n which added to its sum of digits gives 10135131104532.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10135131104533) 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, 60328161253 + ... + 60328161420.
Almost surely, 210135131104532 is an apocalyptic number.
10135131104532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10135131104532 is an abundant number, since it is smaller than the sum of its proper divisors (16891885174444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10135131104532 is a wasteful number, since it uses less digits than its factorization.
10135131104532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120656322687 (or 120656322685 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 10135131104532 its reverse (23540113153101), we get a palindrome (33675244257633).
The spelling of 10135131104532 in words is "ten trillion, one hundred thirty-five billion, one hundred thirty-one million, one hundred four thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •