Base | Representation |
---|---|
bin | 101111101000110110… |
… | …0010011011111100010 |
3 | 100210001121211022021220 |
4 | 1133101230103133202 |
5 | 3134003342101010 |
6 | 114555205155510 |
7 | 10251101126532 |
oct | 1372154233742 |
9 | 323047738256 |
10 | 102302300130 |
11 | 3a427a88288 |
12 | 179b09bbb96 |
13 | 98547ab804 |
14 | 4d46b2b4c2 |
15 | 29db412970 |
hex | 17d1b137e2 |
102302300130 has 16 divisors (see below), whose sum is σ = 245525520384. Its totient is φ = 27280613360.
The previous prime is 102302300129. The next prime is 102302300179. The reversal of 102302300130 is 31003203201.
102302300130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1023023001302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1705038306 + ... + 1705038365.
It is an arithmetic number, because the mean of its divisors is an integer number (15345345024).
Almost surely, 2102302300130 is an apocalyptic number.
102302300130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102302300130 is an abundant number, since it is smaller than the sum of its proper divisors (143223220254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102302300130 is a wasteful number, since it uses less digits than its factorization.
102302300130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3410076681.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 102302300130 its reverse (31003203201), we get a palindrome (133305503331).
The spelling of 102302300130 in words is "one hundred two billion, three hundred two million, three hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •