Base | Representation |
---|---|
bin | 1001001100101011011001… |
… | …1011000001000110101110 |
3 | 1022210211111011211120012010 |
4 | 2103022312123001012232 |
5 | 2311144232332104020 |
6 | 33302012115022050 |
7 | 2062445546540124 |
oct | 223126633010656 |
9 | 38724434746163 |
10 | 10113413550510 |
11 | 324a090325156 |
12 | 117406989a926 |
13 | 5848c9913baa |
14 | 26d6c5809914 |
15 | 128116a6cde0 |
hex | 932b66c11ae |
10113413550510 has 32 divisors (see below), whose sum is σ = 24344216855712. Its totient is φ = 2688907576320.
The previous prime is 10113413550491. The next prime is 10113413550533. The reversal of 10113413550510 is 1505531431101.
It is a super-2 number, since 2×101134135505102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 500158711 + ... + 500178930.
It is an arithmetic number, because the mean of its divisors is an integer number (760756776741).
Almost surely, 210113413550510 is an apocalyptic number.
10113413550510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10113413550510 is an abundant number, since it is smaller than the sum of its proper divisors (14230803305202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113413550510 is a wasteful number, since it uses less digits than its factorization.
10113413550510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000337988.
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 10113413550510 its reverse (1505531431101), we get a palindrome (11618944981611).
The spelling of 10113413550510 in words is "ten trillion, one hundred thirteen billion, four hundred thirteen million, five hundred fifty thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •