Base | Representation |
---|---|
bin | 1001000111110101000100… |
… | …1010011010100110000111 |
3 | 1022111212110122010001012121 |
4 | 2101331101022122212013 |
5 | 2303313131220233111 |
6 | 33155434041430411 |
7 | 2053436325012643 |
oct | 221752112324607 |
9 | 38455418101177 |
10 | 10030110321031 |
11 | 3217822878959 |
12 | 115ba9b79b407 |
13 | 579ab2338b28 |
14 | 269662093c23 |
15 | 125d8d5ae871 |
hex | 91f5129a987 |
10030110321031 has 16 divisors (see below), whose sum is σ = 10382570452800. Its totient is φ = 9678091449600.
The previous prime is 10030110321017. The next prime is 10030110321053. The reversal of 10030110321031 is 13012301103001.
It is a cyclic number.
It is not a de Polignac number, because 10030110321031 - 237 = 9892671367559 is a prime.
It is a super-2 number, since 2×100301103210312 (a number of 27 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 = 10030110320996 and 10030110321014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030110421031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 543952510 + ... + 543970948.
It is an arithmetic number, because the mean of its divisors is an integer number (648910653300).
Almost surely, 210030110321031 is an apocalyptic number.
10030110321031 is a deficient number, since it is larger than the sum of its proper divisors (352460131769).
10030110321031 is a wasteful number, since it uses less digits than its factorization.
10030110321031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29370.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10030110321031 its reverse (13012301103001), we get a palindrome (23042411424032).
The spelling of 10030110321031 in words is "ten trillion, thirty billion, one hundred ten million, three hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •