Base | Representation |
---|---|
bin | 101111101000110101… |
… | …1010001100010111100 |
3 | 100210001121022120202112 |
4 | 1133101223101202330 |
5 | 3134003304430022 |
6 | 114555155313152 |
7 | 10251065623160 |
oct | 1372153214274 |
9 | 323047276675 |
10 | 102302030012 |
11 | 3a427913346 |
12 | 179b08ab7b8 |
13 | 9854715890 |
14 | 4d46a9aca0 |
15 | 29db3ac8e2 |
hex | 17d1ad18bc |
102302030012 has 24 divisors (see below), whose sum is σ = 220342834656. Its totient is φ = 40471132608.
The previous prime is 102302029943. The next prime is 102302030071. The reversal of 102302030012 is 210030203201.
It is a happy number.
102302030012 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×1023020300122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
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, 140524403 + ... + 140525130.
It is an arithmetic number, because the mean of its divisors is an integer number (9180951444).
Almost surely, 2102302030012 is an apocalyptic number.
It is an amenable number.
102302030012 is an abundant number, since it is smaller than the sum of its proper divisors (118040804644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102302030012 is a wasteful number, since it uses less digits than its factorization.
102302030012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281049557 (or 281049555 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 102302030012 its reverse (210030203201), we get a palindrome (312332233213).
The spelling of 102302030012 in words is "one hundred two billion, three hundred two million, thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •