Base | Representation |
---|---|
bin | 1010100001001101011101… |
… | …11001111100001001101100 |
3 | 10000220100000101112100111112 |
4 | 11100212232321330021230 |
5 | 11012440432312010012 |
6 | 121110215434211152 |
7 | 4605120001021442 |
oct | 520465671741154 |
9 | 100810011470445 |
10 | 23131333313132 |
11 | 7408a41693820 |
12 | 2717010883ab8 |
13 | cba376cb8435 |
14 | 59d7c3732b92 |
15 | 2a1a7450e122 |
hex | 1509aee7c26c |
23131333313132 has 96 divisors (see below), whose sum is σ = 47077861555200. Its totient is φ = 9833638464000.
The previous prime is 23131333313087. The next prime is 23131333313149.
23131333313132 is nontrivially palindromic in base 10.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 829036382 + ... + 829064282.
It is an arithmetic number, because the mean of its divisors is an integer number (490394391200).
Almost surely, 223131333313132 is an apocalyptic number.
23131333313132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23131333313132 is an abundant number, since it is smaller than the sum of its proper divisors (23946528242068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23131333313132 is a wasteful number, since it uses less digits than its factorization.
23131333313132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40567 (or 40565 counting only the distinct ones).
The product of its digits is 26244, while the sum is 32.
It can be divided in two parts, 2313133 and 3313132, that added together give a palindrome (5626265).
The spelling of 23131333313132 in words is "twenty-three trillion, one hundred thirty-one billion, three hundred thirty-three million, three hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •