Base | Representation |
---|---|
bin | 11101101100011110101… |
… | …01110010000010101010 |
3 | 10121112121022020001212100 |
4 | 32312033111302002222 |
5 | 113204044344213114 |
6 | 2100420325154230 |
7 | 133500166522332 |
oct | 16661725620252 |
9 | 3545538201770 |
10 | 1020312101034 |
11 | 363791644056 |
12 | 1458b055b976 |
13 | 752a451a235 |
14 | 37551d720c2 |
15 | 1b819ad1909 |
hex | ed8f5720aa |
1020312101034 has 12 divisors (see below), whose sum is σ = 2210676218946. Its totient is φ = 340104033672.
The previous prime is 1020312101027. The next prime is 1020312101057. The reversal of 1020312101034 is 4301012130201.
It can be written as a sum of positive squares in only one way, i.e., 1019992942809 + 319158225 = 1009947^2 + 17865^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 56684005613 = 1020312101034 / (1 + 0 + 2 + 0 + 3 + 1 + 2 + 1 + 0 + 1 + 0 + 3 + 4).
It is a junction number, because it is equal to n+sod(n) for n = 1020312100998 and 1020312101016.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 28342002789 + ... + 28342002824.
Almost surely, 21020312101034 is an apocalyptic number.
1020312101034 is an abundant number, since it is smaller than the sum of its proper divisors (1190364117912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020312101034 is a wasteful number, since it uses less digits than its factorization.
1020312101034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56684005621 (or 56684005618 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1020312101034 its reverse (4301012130201), we get a palindrome (5321324231235).
The spelling of 1020312101034 in words is "one trillion, twenty billion, three hundred twelve million, one hundred one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •