Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011101110001111011 |
3 | 10122110212121020012210211 |
4 | 32333112320131301323 |
5 | 113334122142410021 |
6 | 2105120015251551 |
7 | 134264616110545 |
oct | 16772670356173 |
9 | 3573777205724 |
10 | 1030102310011 |
11 | 367955998a55 |
12 | 147783219bb7 |
13 | 761a49029b8 |
14 | 37c002c4695 |
15 | 1bbde34e3e1 |
hex | efd6e1dc7b |
1030102310011 has 8 divisors (see below), whose sum is σ = 1075007821824. Its totient is φ = 985206669480.
The previous prime is 1030102309991. The next prime is 1030102310059. The reversal of 1030102310011 is 1100132010301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030102310011 - 219 = 1030101785723 is a prime.
It is a super-2 number, since 2×10301023100112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030102309973 and 1030102310000.
It is not an unprimeable number, because it can be changed into a prime (1030102313011) 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, 2254171 + ... + 2672356.
It is an arithmetic number, because the mean of its divisors is an integer number (134375977728).
Almost surely, 21030102310011 is an apocalyptic number.
1030102310011 is a deficient number, since it is larger than the sum of its proper divisors (44905511813).
1030102310011 is an equidigital number, since it uses as much as digits as its factorization.
1030102310011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4935641.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1030102310011 its reverse (1100132010301), we get a palindrome (2130234320312).
The spelling of 1030102310011 in words is "one trillion, thirty billion, one hundred two million, three hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •