Base | Representation |
---|---|
bin | 1001110010101010100001… |
… | …00101110000100011011011 |
3 | 2211020102220201021012211102 |
4 | 10321111100211300203123 |
5 | 10310240040410132311 |
6 | 113443401434422015 |
7 | 4351431414535310 |
oct | 471252045604333 |
9 | 84212821235742 |
10 | 21532023130331 |
11 | 695175279a19a |
12 | 24b9072b9190b |
13 | c025cbc7796c |
14 | 5462268ccd07 |
15 | 27516d78a43b |
hex | 1395509708db |
21532023130331 has 64 divisors (see below), whose sum is σ = 25644868116480. Its totient is φ = 17690718366720.
The previous prime is 21532023130273. The next prime is 21532023130349. The reversal of 21532023130331 is 13303132023512.
It is a de Polignac number, because none of the positive numbers 2k-21532023130331 is a prime.
It is a super-2 number, since 2×215320231303312 (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 = 21532023130294 and 21532023130303.
It is not an unprimeable number, because it can be changed into a prime (21532023130361) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 20142210065 + ... + 20142211133.
It is an arithmetic number, because the mean of its divisors is an integer number (400701064320).
Almost surely, 221532023130331 is an apocalyptic number.
21532023130331 is a deficient number, since it is larger than the sum of its proper divisors (4112844986149).
21532023130331 is a wasteful number, since it uses less digits than its factorization.
21532023130331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2796.
The product of its (nonzero) digits is 9720, while the sum is 29.
Adding to 21532023130331 its reverse (13303132023512), we get a palindrome (34835155153843).
The spelling of 21532023130331 in words is "twenty-one trillion, five hundred thirty-two billion, twenty-three million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •