Base | Representation |
---|---|
bin | 11101101100011110101… |
… | …10100111111111010000 |
3 | 10121112121022122021222021 |
4 | 32312033112213333100 |
5 | 113204044423301000 |
6 | 2100420334021224 |
7 | 133500201432466 |
oct | 16661726477720 |
9 | 3545538567867 |
10 | 1020312322000 |
11 | 363791785074 |
12 | 1458b0647814 |
13 | 752a459699a |
14 | 37551dcc836 |
15 | 1b819b2711a |
hex | ed8f5a7fd0 |
1020312322000 has 40 divisors (see below), whose sum is σ = 2467115199432. Its totient is φ = 408124928000.
The previous prime is 1020312321997. The next prime is 1020312322027. The reversal of 1020312322000 is 2232130201.
It can be written as a sum of positive squares in 4 ways, for example, as 15458446224 + 1004853875776 = 124332^2 + 1002424^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 255076081 + ... + 255080080.
Almost surely, 21020312322000 is an apocalyptic number.
1020312322000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020312322000 is an abundant number, since it is smaller than the sum of its proper divisors (1446802877432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020312322000 is an equidigital number, since it uses as much as digits as its factorization.
1020312322000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510156184 (or 510156168 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1020312322000 its reverse (2232130201), we get a palindrome (1022544452201).
The spelling of 1020312322000 in words is "one trillion, twenty billion, three hundred twelve million, three hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •