Base | Representation |
---|---|
bin | 1010100001010000110100… |
… | …00100110101010110111011 |
3 | 10000220111122200211010100000 |
4 | 11100220122010311112323 |
5 | 11013003123110043003 |
6 | 121111114104044043 |
7 | 4605212362642161 |
oct | 520503204652673 |
9 | 100814580733300 |
10 | 23133131331003 |
11 | 7409784614201 |
12 | 2717432a63623 |
13 | cba5a2663235 |
14 | 59d914451231 |
15 | 2a1b2c2c51a3 |
hex | 150a1a1355bb |
23133131331003 has 24 divisors (see below), whose sum is σ = 34905033032688. Its totient is φ = 15309517549824.
The previous prime is 23133131330957. The next prime is 23133131331007. The reversal of 23133131331003 is 30013313133132.
23133131331003 is a `hidden beast` number, since 2 + 3 + 1 + 3 + 31 + 313 + 310 + 0 + 3 = 666.
It is not a de Polignac number, because 23133131331003 - 232 = 23128836363707 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (23133131331007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 347404926 + ... + 347471507.
It is an arithmetic number, because the mean of its divisors is an integer number (1454376376362).
Almost surely, 223133131331003 is an apocalyptic number.
23133131331003 is a deficient number, since it is larger than the sum of its proper divisors (11771901701685).
23133131331003 is an equidigital number, since it uses as much as digits as its factorization.
23133131331003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694876585 (or 694876573 counting only the distinct ones).
The product of its (nonzero) digits is 4374, while the sum is 27.
Adding to 23133131331003 its reverse (30013313133132), we get a palindrome (53146444464135).
The spelling of 23133131331003 in words is "twenty-three trillion, one hundred thirty-three billion, one hundred thirty-one million, three hundred thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •