Base | Representation |
---|---|
bin | 10111111011011000000110… |
… | …101010101110101100100100 |
3 | 111210121101222000002200002101 |
4 | 113323120012222232230210 |
5 | 102243134100020114304 |
6 | 1011452250422021444 |
7 | 31111002220443460 |
oct | 2773300652565444 |
9 | 453541860080071 |
10 | 105235400551204 |
11 | 305930a0147a20 |
12 | b9773aa877884 |
13 | 469486a7254a1 |
14 | 1bdb5c60514a0 |
15 | c276332678a4 |
hex | 5fb606aaeb24 |
105235400551204 has 96 divisors (see below), whose sum is σ = 229810197012480. Its totient is φ = 40964087424000.
The previous prime is 105235400551201. The next prime is 105235400551319. The reversal of 105235400551204 is 402155004532501.
It is a super-2 number, since 2×1052354005512042 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105235400551201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2504570004 + ... + 2504612020.
It is an arithmetic number, because the mean of its divisors is an integer number (2393856218880).
Almost surely, 2105235400551204 is an apocalyptic number.
105235400551204 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
105235400551204 is an abundant number, since it is smaller than the sum of its proper divisors (124574796461276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105235400551204 is a wasteful number, since it uses less digits than its factorization.
105235400551204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49129 (or 49127 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 37.
The spelling of 105235400551204 in words is "one hundred five trillion, two hundred thirty-five billion, four hundred million, five hundred fifty-one thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •