Base | Representation |
---|---|
bin | 1010100001001011000010… |
… | …10101110101010001010101 |
3 | 10000220012122200212220101212 |
4 | 11100211201111311101111 |
5 | 11012430301143032013 |
6 | 121105442350431205 |
7 | 4605042520041020 |
oct | 520454125652125 |
9 | 100805580786355 |
10 | 23130032002133 |
11 | 7408434080591 |
12 | 2716908b02505 |
13 | cba1ca511824 |
14 | 59d6dc9901b7 |
15 | 2a19ea1606a8 |
hex | 150961575455 |
23130032002133 has 8 divisors (see below), whose sum is σ = 26434657367040. Its totient is φ = 19825490406960.
The previous prime is 23130032002081. The next prime is 23130032002139. The reversal of 23130032002133 is 33120023003132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23130032002133 - 244 = 5537845957717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23130032002099 and 23130032002108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23130032002139) 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, 20349638 + ... + 21456183.
It is an arithmetic number, because the mean of its divisors is an integer number (3304332170880).
Almost surely, 223130032002133 is an apocalyptic number.
It is an amenable number.
23130032002133 is a deficient number, since it is larger than the sum of its proper divisors (3304625364907).
23130032002133 is an equidigital number, since it uses as much as digits as its factorization.
23130032002133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41884867.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 23130032002133 its reverse (33120023003132), we get a palindrome (56250055005265).
The spelling of 23130032002133 in words is "twenty-three trillion, one hundred thirty billion, thirty-two million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •