Base | Representation |
---|---|
bin | 1001000111111100001100… |
… | …0111101010011111011011 |
3 | 1022112001101212122200022010 |
4 | 2101333003013222133123 |
5 | 2303331040140433311 |
6 | 33200351500001003 |
7 | 2053534601515623 |
oct | 221770307523733 |
9 | 38461355580263 |
10 | 10032022202331 |
11 | 3218613aa9648 |
12 | 1160333b30163 |
13 | 57a02846c63c |
14 | 2697a3d71883 |
15 | 125e51367da6 |
hex | 91fc31ea7db |
10032022202331 has 16 divisors (see below), whose sum is σ = 13440127366400. Its totient is φ = 6655969242720.
The previous prime is 10032022202273. The next prime is 10032022202341. The reversal of 10032022202331 is 13320222023001.
It is a happy number.
It is not a de Polignac number, because 10032022202331 - 211 = 10032022200283 is a prime.
It is a super-2 number, since 2×100320222023312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10032022202298 and 10032022202307.
It is not an unprimeable number, because it can be changed into a prime (10032022202341) 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, 11965245 + ... + 12776193.
It is an arithmetic number, because the mean of its divisors is an integer number (840007960400).
Almost surely, 210032022202331 is an apocalyptic number.
10032022202331 is a deficient number, since it is larger than the sum of its proper divisors (3408105164069).
10032022202331 is a wasteful number, since it uses less digits than its factorization.
10032022202331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830706.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 10032022202331 its reverse (13320222023001), we get a palindrome (23352244225332).
The spelling of 10032022202331 in words is "ten trillion, thirty-two billion, twenty-two million, two hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •