Base | Representation |
---|---|
bin | 1001000111111100100110… |
… | …1010100111111100001101 |
3 | 1022112001200112022111211202 |
4 | 2101333021222213330031 |
5 | 2303331301244431341 |
6 | 33200410421555245 |
7 | 2053540404162560 |
oct | 221771152477415 |
9 | 38461615274752 |
10 | 10032132030221 |
11 | 321866aaa29a4 |
12 | 1160364875b25 |
13 | 57a045144562 |
14 | 2697b47a04d7 |
15 | 125e5ad0e79b |
hex | 91fc9aa7f0d |
10032132030221 has 16 divisors (see below), whose sum is σ = 12484893379200. Its totient is φ = 7865482822848.
The previous prime is 10032132030209. The next prime is 10032132030229. The reversal of 10032132030221 is 12203023123001.
It is a de Polignac number, because none of the positive numbers 2k-10032132030221 is a prime.
It is a super-2 number, since 2×100321320302212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10032132030193 and 10032132030202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10032132030229) 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, 1300505870 + ... + 1300513583.
It is an arithmetic number, because the mean of its divisors is an integer number (780305836200).
Almost surely, 210032132030221 is an apocalyptic number.
It is an amenable number.
10032132030221 is a deficient number, since it is larger than the sum of its proper divisors (2452761348979).
10032132030221 is a wasteful number, since it uses less digits than its factorization.
10032132030221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2601019508.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10032132030221 its reverse (12203023123001), we get a palindrome (22235155153222).
The spelling of 10032132030221 in words is "ten trillion, thirty-two billion, one hundred thirty-two million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •