Base | Representation |
---|---|
bin | 1001010011101001011101… |
… | …0110101110001110111111 |
3 | 1100020021112220202022200112 |
4 | 2110322113112232032333 |
5 | 2320124443230241411 |
6 | 33433013405020235 |
7 | 2104215013565543 |
oct | 224722726561677 |
9 | 40207486668615 |
10 | 10233151415231 |
11 | 3295945218148 |
12 | 119330585467b |
13 | 592c9c6ca114 |
14 | 275403dd7a23 |
15 | 12b2c39e3b8b |
hex | 94e975ae3bf |
10233151415231 has 8 divisors (see below), whose sum is σ = 10282453829424. Its totient is φ = 10183940388160.
The previous prime is 10233151415219. The next prime is 10233151415239. The reversal of 10233151415231 is 13251415133201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10233151415231 is a prime.
It is a super-2 number, since 2×102331514152312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10233151415239) 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, 22622285 + ... + 23070198.
It is an arithmetic number, because the mean of its divisors is an integer number (1285306728678).
Almost surely, 210233151415231 is an apocalyptic number.
10233151415231 is a deficient number, since it is larger than the sum of its proper divisors (49302414193).
10233151415231 is an equidigital number, since it uses as much as digits as its factorization.
10233151415231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45693561.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 10233151415231 its reverse (13251415133201), we get a palindrome (23484566548432).
The spelling of 10233151415231 in words is "ten trillion, two hundred thirty-three billion, one hundred fifty-one million, four hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •