Base | Representation |
---|---|
bin | 1010100001100111100011… |
… | …11101111010101011101011 |
3 | 10000221200011202212000002002 |
4 | 11100303301331322223223 |
5 | 11013203130343043201 |
6 | 121120453545401215 |
7 | 4606124120142644 |
oct | 520636175725353 |
9 | 100850152760062 |
10 | 23145343331051 |
11 | 7413980a04627 |
12 | 271988079920b |
13 | cbb79a6c4076 |
14 | 5a03522966cb |
15 | 2a20e447076b |
hex | 150cf1f7aaeb |
23145343331051 has 4 divisors (see below), whose sum is σ = 23891967309504. Its totient is φ = 22398719352600.
The previous prime is 23145343331021. The next prime is 23145343331063. The reversal of 23145343331051 is 15013334354132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23145343331051 - 218 = 23145343068907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23145343330996 and 23145343331014.
It is not an unprimeable number, because it can be changed into a prime (23145343331021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 373311989180 + ... + 373311989241.
It is an arithmetic number, because the mean of its divisors is an integer number (5972991827376).
Almost surely, 223145343331051 is an apocalyptic number.
23145343331051 is a deficient number, since it is larger than the sum of its proper divisors (746623978453).
23145343331051 is an equidigital number, since it uses as much as digits as its factorization.
23145343331051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746623978452.
The product of its (nonzero) digits is 194400, while the sum is 38.
Adding to 23145343331051 its reverse (15013334354132), we get a palindrome (38158677685183).
The spelling of 23145343331051 in words is "twenty-three trillion, one hundred forty-five billion, three hundred forty-three million, three hundred thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •