Base | Representation |
---|---|
bin | 10110000011100000… |
… | …101111101011101010 |
3 | 2021010101102102021100 |
4 | 112003200233223222 |
5 | 341444344020230 |
6 | 14513511022230 |
7 | 1465562116320 |
oct | 260340575352 |
9 | 67111372240 |
10 | 23681235690 |
11 | a052492972 |
12 | 470a96a976 |
13 | 230525b6c8 |
14 | 120917dd10 |
15 | 939027660 |
hex | 58382faea |
23681235690 has 96 divisors (see below), whose sum is σ = 70607811456. Its totient is φ = 5394337920.
The previous prime is 23681235659. The next prime is 23681235703. The reversal of 23681235690 is 9653218632.
23681235690 is a `hidden beast` number, since 2 + 3 + 6 + 81 + 2 + 3 + 569 + 0 = 666.
It is a super-2 number, since 2×236812356902 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 120445 + ... + 248735.
It is an arithmetic number, because the mean of its divisors is an integer number (735498036).
Almost surely, 223681235690 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23681235690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35303905728).
23681235690 is an abundant number, since it is smaller than the sum of its proper divisors (46926575766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23681235690 is a wasteful number, since it uses less digits than its factorization.
23681235690 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128604 (or 128601 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 45.
The spelling of 23681235690 in words is "twenty-three billion, six hundred eighty-one million, two hundred thirty-five thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •