Base | Representation |
---|---|
bin | 1001010111101010110011… |
… | …0001001001110010010110 |
3 | 1100110212212010120020102010 |
4 | 2111322230301021302112 |
5 | 2322242431404021402 |
6 | 33524440145525050 |
7 | 2112211603225653 |
oct | 225725461116226 |
9 | 40425763506363 |
10 | 10302230142102 |
11 | 3312173378068 |
12 | 11a4784043786 |
13 | 59965b010332 |
14 | 2788b8516c2a |
15 | 12ceb82c4a6c |
hex | 95eacc49c96 |
10302230142102 has 64 divisors (see below), whose sum is σ = 21999809260800. Its totient is φ = 3206967552000.
The previous prime is 10302230142101. The next prime is 10302230142109. The reversal of 10302230142102 is 20124103220301.
10302230142102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103022301421022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302230142101) 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, 919674 + ... + 4631442.
It is an arithmetic number, because the mean of its divisors is an integer number (343747019700).
Almost surely, 210302230142102 is an apocalyptic number.
10302230142102 is an abundant number, since it is smaller than the sum of its proper divisors (11697579118698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302230142102 is a wasteful number, since it uses less digits than its factorization.
10302230142102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3712141.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10302230142102 its reverse (20124103220301), we get a palindrome (30426333362403).
The spelling of 10302230142102 in words is "ten trillion, three hundred two billion, two hundred thirty million, one hundred forty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •