Base | Representation |
---|---|
bin | 1010100000010101101110… |
… | …11001011000010000001000 |
3 | 10000210110210001102102022220 |
4 | 11100022313121120100020 |
5 | 11011443142204020402 |
6 | 121044350335214040 |
7 | 4603010333410035 |
oct | 520126731302010 |
9 | 100713701372286 |
10 | 23101411001352 |
11 | 73a7287292032 |
12 | 271125b977320 |
13 | cb75b8a543c8 |
14 | 59c18574c38c |
15 | 2a0dc262ddbc |
hex | 1502b7658408 |
23101411001352 has 32 divisors (see below), whose sum is σ = 59314433654400. Its totient is φ = 7492349513664.
The previous prime is 23101411001321. The next prime is 23101411001359. The reversal of 23101411001352 is 25310011410132.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (23101411001359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13007550352 + ... + 13007552127.
It is an arithmetic number, because the mean of its divisors is an integer number (1853576051700).
Almost surely, 223101411001352 is an apocalyptic number.
It is an amenable number.
23101411001352 is an abundant number, since it is smaller than the sum of its proper divisors (36213022653048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23101411001352 is a wasteful number, since it uses less digits than its factorization.
23101411001352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26015102525 (or 26015102521 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 23101411001352 its reverse (25310011410132), we get a palindrome (48411422411484).
The spelling of 23101411001352 in words is "twenty-three trillion, one hundred one billion, four hundred eleven million, one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •