Base | Representation |
---|---|
bin | 10111010000101100010000… |
… | …101000101101010010100110 |
3 | 111102012222121121021002200020 |
4 | 113100230100220231102212 |
5 | 101402104202403131100 |
6 | 1001324534401100010 |
7 | 30356040350654442 |
oct | 2720542050552246 |
9 | 442188547232606 |
10 | 102302105130150 |
11 | 2a662096376742 |
12 | b582a00027606 |
13 | 451107c6a1b53 |
14 | 1b3963c227822 |
15 | bc61a4b885a0 |
hex | 5d0b10a2d4a6 |
102302105130150 has 48 divisors (see below), whose sum is σ = 254067061918800. Its totient is φ = 27242083820160.
The previous prime is 102302105130109. The next prime is 102302105130209. The reversal of 102302105130150 is 51031501203201.
It is a self number, because there is not a number n which added to its sum of digits gives 102302105130150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 480862645 + ... + 481075344.
It is an arithmetic number, because the mean of its divisors is an integer number (5293063789975).
Almost surely, 2102302105130150 is an apocalyptic number.
102302105130150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102302105130150 is an abundant number, since it is smaller than the sum of its proper divisors (151764956788650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102302105130150 is a wasteful number, since it uses less digits than its factorization.
102302105130150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 961938713 (or 961938708 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 102302105130150 its reverse (51031501203201), we get a palindrome (153333606333351).
The spelling of 102302105130150 in words is "one hundred two trillion, three hundred two billion, one hundred five million, one hundred thirty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •