Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011011100101100111 |
3 | 10122110212121012202111020 |
4 | 32333112320123211213 |
5 | 113334122142113111 |
6 | 2105120015142223 |
7 | 134264616042426 |
oct | 16772670334547 |
9 | 3573777182436 |
10 | 1030102301031 |
11 | 367955992231 |
12 | 147783214973 |
13 | 761a48cb89b |
14 | 37c002c12bd |
15 | 1bbde34b906 |
hex | efd6e1b967 |
1030102301031 has 8 divisors (see below), whose sum is σ = 1374613344624. Its totient is φ = 686163062400.
The previous prime is 1030102300979. The next prime is 1030102301089. The reversal of 1030102301031 is 1301032010301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030102301031 - 221 = 1030100203879 is a prime.
It is a super-2 number, since 2×10301023010312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030102301031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030102301131) 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, 142947036 + ... + 142954241.
It is an arithmetic number, because the mean of its divisors is an integer number (171826668078).
Almost surely, 21030102301031 is an apocalyptic number.
1030102301031 is a deficient number, since it is larger than the sum of its proper divisors (344511043593).
1030102301031 is a wasteful number, since it uses less digits than its factorization.
1030102301031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285902481.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1030102301031 its reverse (1301032010301), we get a palindrome (2331134311332).
The spelling of 1030102301031 in words is "one trillion, thirty billion, one hundred two million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •