Base | Representation |
---|---|
bin | 1010011111000000000101… |
… | …11101100010101010100011 |
3 | 10000122002002211211110121201 |
4 | 11033200002331202222203 |
5 | 11010220012114212011 |
6 | 121011304211302031 |
7 | 4566462102436402 |
oct | 517400275425243 |
9 | 100562084743551 |
10 | 23055434132131 |
11 | 7389833571755 |
12 | 270436a2aa917 |
13 | cb316c64454b |
14 | 599c63473639 |
15 | 29ead107ccc1 |
hex | 14f802f62aa3 |
23055434132131 has 2 divisors, whose sum is σ = 23055434132132. Its totient is φ = 23055434132130.
The previous prime is 23055434132123. The next prime is 23055434132147. The reversal of 23055434132131 is 13123143455032.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23055434132131 - 23 = 23055434132123 is a prime.
It is a super-2 number, since 2×230554341321312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23055434732131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11527717066065 + 11527717066066.
It is an arithmetic number, because the mean of its divisors is an integer number (11527717066066).
Almost surely, 223055434132131 is an apocalyptic number.
23055434132131 is a deficient number, since it is larger than the sum of its proper divisors (1).
23055434132131 is an equidigital number, since it uses as much as digits as its factorization.
23055434132131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 23055434132131 its reverse (13123143455032), we get a palindrome (36178577587163).
The spelling of 23055434132131 in words is "twenty-three trillion, fifty-five billion, four hundred thirty-four million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •