Base | Representation |
---|---|
bin | 1010100001001111001000… |
… | …11010011000100011100111 |
3 | 10000220102022221201002211111 |
4 | 11100213210122120203213 |
5 | 11012444302114314120 |
6 | 121110444503045451 |
7 | 4605151151230153 |
oct | 520474432304347 |
9 | 100812287632744 |
10 | 23132231010535 |
11 | 74093623930a9 |
12 | 2717221440887 |
13 | cba48ac86a2a |
14 | 59d86aa50063 |
15 | 2a1ac823375a |
hex | 1509e46988e7 |
23132231010535 has 8 divisors (see below), whose sum is σ = 27758725536816. Its totient is φ = 18505752592320.
The previous prime is 23132231010463. The next prime is 23132231010547. The reversal of 23132231010535 is 53501013223132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23132231010535 - 29 = 23132231010023 is a prime.
It is a super-2 number, since 2×231322310105352 (a number of 28 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 = 23132231010497 and 23132231010506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 603006 + ... + 6828475.
It is an arithmetic number, because the mean of its divisors is an integer number (3469840692102).
Almost surely, 223132231010535 is an apocalyptic number.
23132231010535 is a deficient number, since it is larger than the sum of its proper divisors (4626494526281).
23132231010535 is an equidigital number, since it uses as much as digits as its factorization.
23132231010535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8054033.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 23132231010535 its reverse (53501013223132), we get a palindrome (76633244233667).
The spelling of 23132231010535 in words is "twenty-three trillion, one hundred thirty-two billion, two hundred thirty-one million, ten thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •