Base | Representation |
---|---|
bin | 1010110000111010101101… |
… | …11110101111100000110100 |
3 | 10002210221001100212201201110 |
4 | 11120131112332233200310 |
5 | 11100311224124300442 |
6 | 122202152431555020 |
7 | 4662114020446530 |
oct | 530352676574064 |
9 | 102727040781643 |
10 | 23671024056372 |
11 | 75a6908a83060 |
12 | 27a372a08ba70 |
13 | 10292250c94a4 |
14 | 5bb980020bc0 |
15 | 2b0b0e8dc69c |
hex | 158756faf834 |
23671024056372 has 192 divisors, whose sum is σ = 72516521871360. Its totient is φ = 5822224012800.
The previous prime is 23671024056293. The next prime is 23671024056409. The reversal of 23671024056372 is 27365042017632.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40810618 + ... + 41386574.
It is an arithmetic number, because the mean of its divisors is an integer number (377690218080).
Almost surely, 223671024056372 is an apocalyptic number.
23671024056372 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23671024056372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36258260935680).
23671024056372 is an abundant number, since it is smaller than the sum of its proper divisors (48845497814988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23671024056372 is a wasteful number, since it uses less digits than its factorization.
23671024056372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578342 (or 578340 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 48.
The spelling of 23671024056372 in words is "twenty-three trillion, six hundred seventy-one billion, twenty-four million, fifty-six thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •