Base | Representation |
---|---|
bin | 1010100000010101011100… |
… | …11011101110011001100011 |
3 | 10000210110101120110022211110 |
4 | 11100022232123232121203 |
5 | 11011442340204341121 |
6 | 121044323404114403 |
7 | 4603003526245410 |
oct | 520125633563143 |
9 | 100713346408743 |
10 | 23101260621411 |
11 | 73a720a410395 |
12 | 2711219535a03 |
13 | cb75938515ab |
14 | 59c16d7a5107 |
15 | 2a0db4326d76 |
hex | 1502ae6ee663 |
23101260621411 has 16 divisors (see below), whose sum is σ = 35359777101824. Its totient is φ = 13141524297024.
The previous prime is 23101260621403. The next prime is 23101260621427. The reversal of 23101260621411 is 11412606210132.
It is not a de Polignac number, because 23101260621411 - 23 = 23101260621403 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23101260621611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2466497626 + ... + 2466506991.
It is an arithmetic number, because the mean of its divisors is an integer number (2209986068864).
Almost surely, 223101260621411 is an apocalyptic number.
23101260621411 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23101260621411 is a deficient number, since it is larger than the sum of its proper divisors (12258516480413).
23101260621411 is a wasteful number, since it uses less digits than its factorization.
23101260621411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4933004850.
The product of its (nonzero) digits is 3456, while the sum is 30.
Adding to 23101260621411 its reverse (11412606210132), we get a palindrome (34513866831543).
The spelling of 23101260621411 in words is "twenty-three trillion, one hundred one billion, two hundred sixty million, six hundred twenty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.086 sec. • engine limits •