Base | Representation |
---|---|
bin | 100010000111000001011001… |
… | …0000101100001000100110101 |
3 | 1110100022210121111121202202111 |
4 | 1010032002302011201010311 |
5 | 303311211443121020041 |
6 | 2542040522303411021 |
7 | 120124420121354665 |
oct | 10416026205410465 |
9 | 1410283544552674 |
10 | 300032223220021 |
11 | 87665a51202676 |
12 | 297983085b3a71 |
13 | cb54bc026b506 |
14 | 54138cc2441a5 |
15 | 24a47d773e981 |
hex | 110e0b2161135 |
300032223220021 has 16 divisors (see below), whose sum is σ = 316228670524800. Its totient is φ = 283876336800000.
The previous prime is 300032223220013. The next prime is 300032223220033. The reversal of 300032223220021 is 120022322230003.
It is a cyclic number.
It is not a de Polignac number, because 300032223220021 - 23 = 300032223220013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300032223219974 and 300032223220001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300032223220001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 333885921 + ... + 334783321.
It is an arithmetic number, because the mean of its divisors is an integer number (19764291907800).
Almost surely, 2300032223220021 is an apocalyptic number.
It is an amenable number.
300032223220021 is a deficient number, since it is larger than the sum of its proper divisors (16196447304779).
300032223220021 is a wasteful number, since it uses less digits than its factorization.
300032223220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919980.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 300032223220021 its reverse (120022322230003), we get a palindrome (420054545450024).
The spelling of 300032223220021 in words is "three hundred trillion, thirty-two billion, two hundred twenty-three million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •