Base | Representation |
---|---|
bin | 1110100011111111100000… |
… | …01100100101010010111101 |
3 | 11012101100222200211122101202 |
4 | 13101333300030211102331 |
5 | 13144131111310201023 |
6 | 152035100154145245 |
7 | 6513405031351064 |
oct | 721776014452275 |
9 | 135340880748352 |
10 | 32023011022013 |
11 | a22697897a300 |
12 | 3712335722225 |
13 | 14b39ac12157b |
14 | 7c9cc9d971db |
15 | 3a7ed3042128 |
hex | 1d1ff03254bd |
32023011022013 has 6 divisors (see below), whose sum is σ = 35198846825982. Its totient is φ = 29111828201720.
The previous prime is 32023011021973. The next prime is 32023011022033. The reversal of 32023011022013 is 31022011032023.
It can be written as a sum of positive squares in only one way, i.e., 28518825451204 + 3504185570809 = 5340302^2 + 1871947^2 .
It is not a de Polignac number, because 32023011022013 - 216 = 32023010956477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32023011022033) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 132326491706 + ... + 132326491947.
It is an arithmetic number, because the mean of its divisors is an integer number (5866474470997).
Almost surely, 232023011022013 is an apocalyptic number.
It is an amenable number.
32023011022013 is a deficient number, since it is larger than the sum of its proper divisors (3175835803969).
32023011022013 is a wasteful number, since it uses less digits than its factorization.
32023011022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264652983675 (or 264652983664 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 32023011022013 its reverse (31022011032023), we get a palindrome (63045022054036).
The spelling of 32023011022013 in words is "thirty-two trillion, twenty-three billion, eleven million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •