Base | Representation |
---|---|
bin | 11101111110110000000… |
… | …11101001110111010110 |
3 | 10122110220222022121020220 |
4 | 32333120003221313112 |
5 | 113334142214122220 |
6 | 2105122001535210 |
7 | 134265245462145 |
oct | 16773003516726 |
9 | 3573828277226 |
10 | 1030122020310 |
11 | 367966030659 |
12 | 147789944506 |
13 | 761a8a142b6 |
14 | 37c02b7575c |
15 | 1bbe0e44540 |
hex | efd80e9dd6 |
1030122020310 has 32 divisors (see below), whose sum is σ = 2475348893280. Its totient is φ = 274359644928.
The previous prime is 1030122020287. The next prime is 1030122020327. The reversal of 1030122020310 is 130202210301.
It is a super-2 number, since 2×10301220203102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1030122020310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21197857 + ... + 21246396.
It is an arithmetic number, because the mean of its divisors is an integer number (77354652915).
Almost surely, 21030122020310 is an apocalyptic number.
1030122020310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030122020310 is an abundant number, since it is smaller than the sum of its proper divisors (1445226872970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030122020310 is a wasteful number, since it uses less digits than its factorization.
1030122020310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42445072.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1030122020310 its reverse (130202210301), we get a palindrome (1160324230611).
The spelling of 1030122020310 in words is "one trillion, thirty billion, one hundred twenty-two million, twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •