Base | Representation |
---|---|
bin | 11101111110100101001… |
… | …10001010111001011111 |
3 | 10122110200120221001222020 |
4 | 32333102212022321133 |
5 | 113334000240431330 |
6 | 2105104530151223 |
7 | 134263053661560 |
oct | 16772246127137 |
9 | 3573616831866 |
10 | 1030030405215 |
11 | 3679193468a9 |
12 | 147763122513 |
13 | 76192a48196 |
14 | 37bd4928167 |
15 | 1bbd7d99210 |
hex | efd298ae5f |
1030030405215 has 192 divisors, whose sum is σ = 2028831866880. Its totient is φ = 436641891840.
The previous prime is 1030030405211. The next prime is 1030030405219. The reversal of 1030030405215 is 5125040300301.
It is an interprime number because it is at equal distance from previous prime (1030030405211) and next prime (1030030405219).
It is not a de Polignac number, because 1030030405215 - 22 = 1030030405211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030030405211) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 380504892 + ... + 380507598.
It is an arithmetic number, because the mean of its divisors is an integer number (10566832640).
Almost surely, 21030030405215 is an apocalyptic number.
1030030405215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1030030405215 is a deficient number, since it is larger than the sum of its proper divisors (998801461665).
1030030405215 is a wasteful number, since it uses less digits than its factorization.
1030030405215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2950 (or 2921 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
Adding to 1030030405215 its reverse (5125040300301), we get a palindrome (6155070705516).
The spelling of 1030030405215 in words is "one trillion, thirty billion, thirty million, four hundred five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •