Base | Representation |
---|---|
bin | 1001010111101011011100… |
… | …1001111100011001100110 |
3 | 1100110220022021111010011221 |
4 | 2111322313021330121212 |
5 | 2322243311012204110 |
6 | 33524505333050554 |
7 | 2112216120423322 |
oct | 225726711743146 |
9 | 40426267433157 |
10 | 10302404413030 |
11 | 3312252787424 |
12 | 11a4812486a5a |
13 | 599688159622 |
14 | 2788d371c982 |
15 | 12cec874a7da |
hex | 95eb727c666 |
10302404413030 has 16 divisors (see below), whose sum is σ = 18544533549840. Its totient is φ = 4120916074912.
The previous prime is 10302404413001. The next prime is 10302404413033. The reversal of 10302404413030 is 3031440420301.
It is a super-2 number, since 2×103024044130302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10302404412986 and 10302404413004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302404413033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4756660 + ... + 6574999.
It is an arithmetic number, because the mean of its divisors is an integer number (1159033346865).
Almost surely, 210302404413030 is an apocalyptic number.
10302404413030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10302404413030 is a deficient number, since it is larger than the sum of its proper divisors (8242129136810).
10302404413030 is a wasteful number, since it uses less digits than its factorization.
10302404413030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11422583.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 10302404413030 its reverse (3031440420301), we get a palindrome (13333844833331).
The spelling of 10302404413030 in words is "ten trillion, three hundred two billion, four hundred four million, four hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •