Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011100000111101000 |
3 | 10122110212121012212110212 |
4 | 32333112320130013220 |
5 | 113334122142200313 |
6 | 2105120015200252 |
7 | 134264616051656 |
oct | 16772670340750 |
9 | 3573777185425 |
10 | 1030102303208 |
11 | 367955993930 |
12 | 147783216088 |
13 | 761a48cc884 |
14 | 37c002c1dd6 |
15 | 1bbde34c3a8 |
hex | efd6e1c1e8 |
1030102303208 has 16 divisors (see below), whose sum is σ = 2107027438560. Its totient is φ = 468228319600.
The previous prime is 1030102303201. The next prime is 1030102303211. The reversal of 1030102303208 is 8023032010301.
It is a super-2 number, since 2×10301023032082 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1030102303201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5852853908 + ... + 5852854083.
It is an arithmetic number, because the mean of its divisors is an integer number (131689214910).
Almost surely, 21030102303208 is an apocalyptic number.
It is an amenable number.
1030102303208 is an abundant number, since it is smaller than the sum of its proper divisors (1076925135352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030102303208 is a wasteful number, since it uses less digits than its factorization.
1030102303208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11705708008 (or 11705708004 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1030102303208 its reverse (8023032010301), we get a palindrome (9053134313509).
The spelling of 1030102303208 in words is "one trillion, thirty billion, one hundred two million, three hundred three thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •