Base | Representation |
---|---|
bin | 11101111110101111110… |
… | …11111100101100110111 |
3 | 10122110220211111222100010 |
4 | 32333113323330230313 |
5 | 113334141210002221 |
6 | 2105121450351303 |
7 | 134265222350013 |
oct | 16772773745467 |
9 | 3573824458303 |
10 | 1030120000311 |
11 | 367964980a36 |
12 | 14778912b533 |
13 | 761a8487a2c |
14 | 37c027ab543 |
15 | 1bbe0b95c76 |
hex | efd7efcb37 |
1030120000311 has 8 divisors (see below), whose sum is σ = 1405435039360. Its totient is φ = 670775814072.
The previous prime is 1030120000297. The next prime is 1030120000331. The reversal of 1030120000311 is 1130000210301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030120000311 - 25 = 1030120000279 is a prime.
It is a super-3 number, since 3×10301200003113 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030120000331) 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, 3992713051 + ... + 3992713308.
It is an arithmetic number, because the mean of its divisors is an integer number (175679379920).
Almost surely, 21030120000311 is an apocalyptic number.
1030120000311 is a deficient number, since it is larger than the sum of its proper divisors (375315039049).
1030120000311 is an equidigital number, since it uses as much as digits as its factorization.
1030120000311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7985426405.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 1030120000311 its reverse (1130000210301), we get a palindrome (2160120210612).
The spelling of 1030120000311 in words is "one trillion, thirty billion, one hundred twenty million, three hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •