Base | Representation |
---|---|
bin | 1010100100011101111000… |
… | …00000111110100001000100 |
3 | 10001022000211010121110102121 |
4 | 11102032330000332201010 |
5 | 11021304104414130312 |
6 | 121233442230015324 |
7 | 4616160501455020 |
oct | 522167400764104 |
9 | 101260733543377 |
10 | 23243222411332 |
11 | 7451439113310 |
12 | 27348381a7544 |
13 | cc7a9899ca11 |
14 | 5a4d99783380 |
15 | 2a49223ae707 |
hex | 1523bc03e844 |
23243222411332 has 48 divisors (see below), whose sum is σ = 51186433794048. Its totient is φ = 8971167273120.
The previous prime is 23243222411273. The next prime is 23243222411347. The reversal of 23243222411332 is 23311422234232.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 352607268 + ... + 352673179.
It is an arithmetic number, because the mean of its divisors is an integer number (1066384037376).
Almost surely, 223243222411332 is an apocalyptic number.
23243222411332 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23243222411332 is an abundant number, since it is smaller than the sum of its proper divisors (27943211382716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23243222411332 is a wasteful number, since it uses less digits than its factorization.
23243222411332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705280576 (or 705280574 counting only the distinct ones).
The product of its digits is 82944, while the sum is 34.
Adding to 23243222411332 its reverse (23311422234232), we get a palindrome (46554644645564).
The spelling of 23243222411332 in words is "twenty-three trillion, two hundred forty-three billion, two hundred twenty-two million, four hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •