Base | Representation |
---|---|
bin | 1010011111001011000101… |
… | …11111100001101111100011 |
3 | 10000122122100110012110110022 |
4 | 11033211202333201233203 |
5 | 11010314111044421200 |
6 | 121014122231424055 |
7 | 4600061336451413 |
oct | 517454277415743 |
9 | 100578313173408 |
10 | 23061340232675 |
11 | 7391294398488 |
12 | 270553822502b |
13 | cb38a11244b4 |
14 | 59a2639dc643 |
15 | 29ed29818885 |
hex | 14f962fe1be3 |
23061340232675 has 24 divisors (see below), whose sum is σ = 28804113445536. Its totient is φ = 18315255248640.
The previous prime is 23061340232663. The next prime is 23061340232687. The reversal of 23061340232675 is 57623204316032.
It is an interprime number because it is at equal distance from previous prime (23061340232663) and next prime (23061340232687).
It is not a de Polignac number, because 23061340232675 - 28 = 23061340232419 is a prime.
It is a super-3 number, since 3×230613402326753 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2872367 + ... + 7373816.
It is an arithmetic number, because the mean of its divisors is an integer number (1200171393564).
Almost surely, 223061340232675 is an apocalyptic number.
23061340232675 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
23061340232675 is a deficient number, since it is larger than the sum of its proper divisors (5742773212861).
23061340232675 is a wasteful number, since it uses less digits than its factorization.
23061340232675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10246847 (or 10246842 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 44.
The spelling of 23061340232675 in words is "twenty-three trillion, sixty-one billion, three hundred forty million, two hundred thirty-two thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •