Base | Representation |
---|---|
bin | 110100101001000011110011… |
… | …011100110100000001110111 |
3 | 1010100202002120222101110210211 |
4 | 310221003303130310001313 |
5 | 220321210430343241330 |
6 | 2140222453112530251 |
7 | 66523524315642643 |
oct | 6451036334640167 |
9 | 1110662528343724 |
10 | 231520001540215 |
11 | 67851099178a13 |
12 | 21b721640b0987 |
13 | 9c2531c90b40b |
14 | 41258b0c03c23 |
15 | 1bb7577184d2a |
hex | d290f3734077 |
231520001540215 has 32 divisors (see below), whose sum is σ = 282901016140416. Its totient is φ = 181842598325760.
The previous prime is 231520001540173. The next prime is 231520001540251. The reversal of 231520001540215 is 512045100025132.
231520001540215 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 231520001540215 - 221 = 231519999443063 is a prime.
It is a super-2 number, since 2×2315200015402152 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5268621534 + ... + 5268665476.
It is an arithmetic number, because the mean of its divisors is an integer number (8840656754388).
Almost surely, 2231520001540215 is an apocalyptic number.
231520001540215 is a deficient number, since it is larger than the sum of its proper divisors (51381014600201).
231520001540215 is a wasteful number, since it uses less digits than its factorization.
231520001540215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75579.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 231520001540215 its reverse (512045100025132), we get a palindrome (743565101565347).
The spelling of 231520001540215 in words is "two hundred thirty-one trillion, five hundred twenty billion, one million, five hundred forty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •