Base | Representation |
---|---|
bin | 110100110111011000010111… |
… | …101010000011111111001101 |
3 | 1010111020011212102120122212012 |
4 | 310313120113222003333031 |
5 | 220433322003031112023 |
6 | 2142254533541151005 |
7 | 66654604513054112 |
oct | 6467302752037715 |
9 | 1114204772518765 |
10 | 232504156504013 |
11 | 680a0505a80669 |
12 | 220b0a436bb465 |
13 | 9c9708126a094 |
14 | 415b392ad6909 |
15 | 1bd2e77815978 |
hex | d37617a83fcd |
232504156504013 has 8 divisors (see below), whose sum is σ = 232565409458016. Its totient is φ = 232442909859600.
The previous prime is 232504156503959. The next prime is 232504156504069. The reversal of 232504156504013 is 310405651405232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232504156504013 - 212 = 232504156499917 is a prime.
It is a super-2 number, since 2×2325041565040132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232504156554013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72589670 + ... + 75724952.
It is an arithmetic number, because the mean of its divisors is an integer number (29070676182252).
Almost surely, 2232504156504013 is an apocalyptic number.
It is an amenable number.
232504156504013 is a deficient number, since it is larger than the sum of its proper divisors (61252954003).
232504156504013 is a wasteful number, since it uses less digits than its factorization.
232504156504013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3154795.
The product of its (nonzero) digits is 432000, while the sum is 41.
The spelling of 232504156504013 in words is "two hundred thirty-two trillion, five hundred four billion, one hundred fifty-six million, five hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •