Base | Representation |
---|---|
bin | 1001000110011000000111… |
… | …00011101100101111010010 |
3 | 2121211222010001220202000200 |
4 | 10203030003203230233102 |
5 | 10110322104423301002 |
6 | 110320335515000030 |
7 | 4133461123223412 |
oct | 443140343545722 |
9 | 77758101822020 |
10 | 20010312322002 |
11 | 6415364702202 |
12 | 22b2171139016 |
13 | b21c6c8c4712 |
14 | 4d270ba80642 |
15 | 24a7aa388b1c |
hex | 1233038ecbd2 |
20010312322002 has 24 divisors (see below), whose sum is σ = 44527451745036. Its totient is φ = 6489831023136.
The previous prime is 20010312321983. The next prime is 20010312322009. The reversal of 20010312322002 is 20022321301002.
20010312322002 is a `hidden beast` number, since 20 + 0 + 10 + 312 + 322 + 0 + 0 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 19999061264961 + 11251057041 = 4472031^2 + 106071^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (20010312322009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15022756333 + ... + 15022757664.
Almost surely, 220010312322002 is an apocalyptic number.
20010312322002 is an abundant number, since it is smaller than the sum of its proper divisors (24517139423034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010312322002 is a wasteful number, since it uses less digits than its factorization.
20010312322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30045514042 (or 30045514039 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20010312322002 its reverse (20022321301002), we get a palindrome (40032633623004).
The spelling of 20010312322002 in words is "twenty trillion, ten billion, three hundred twelve million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •