Base | Representation |
---|---|
bin | 1010011110010100110100… |
… | …00111101000100000010011 |
3 | 10000112212010122100012101001 |
4 | 11033022122013220200103 |
5 | 11004324421241131311 |
6 | 120552502522322431 |
7 | 4565010252422560 |
oct | 517123207504023 |
9 | 100485118305331 |
10 | 23032200333331 |
11 | 737a9a0704842 |
12 | 26bb965359417 |
13 | cb0c08cc5cc7 |
14 | 598a9b8c5867 |
15 | 29e1c14894c1 |
hex | 14f29a1e8813 |
23032200333331 has 16 divisors (see below), whose sum is σ = 27195695319040. Its totient is φ = 19088128664640.
The previous prime is 23032200333301. The next prime is 23032200333367. The reversal of 23032200333331 is 13333300223032.
It is not a de Polignac number, because 23032200333331 - 213 = 23032200325139 is a prime.
It is a super-2 number, since 2×230322003333312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23032200333331.
It is not an unprimeable number, because it can be changed into a prime (23032200333301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46760841 + ... + 47250826.
It is an arithmetic number, because the mean of its divisors is an integer number (1699730957440).
Almost surely, 223032200333331 is an apocalyptic number.
23032200333331 is a deficient number, since it is larger than the sum of its proper divisors (4163494985709).
23032200333331 is a wasteful number, since it uses less digits than its factorization.
23032200333331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94012834.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 23032200333331 its reverse (13333300223032), we get a palindrome (36365500556363).
The spelling of 23032200333331 in words is "twenty-three trillion, thirty-two billion, two hundred million, three hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •