Base | Representation |
---|---|
bin | 1010100001110010101111… |
… | …01010010011000011100011 |
3 | 10000222020122222222111001102 |
4 | 11100321113222103003203 |
5 | 11013302423133300311 |
6 | 121123325242025015 |
7 | 4606425616513064 |
oct | 520712752230343 |
9 | 100866588874042 |
10 | 23151344431331 |
11 | 7416480417036 |
12 | 271aa764a816b |
13 | cbc215a8688c |
14 | 5a07612b056b |
15 | 2a234622443b |
hex | 150e57a930e3 |
23151344431331 has 4 divisors (see below), whose sum is σ = 23898161993664. Its totient is φ = 22404526869000.
The previous prime is 23151344431291. The next prime is 23151344431339. The reversal of 23151344431331 is 13313444315132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23151344431331 is a prime.
It is a super-2 number, since 2×231513444313312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23151344431339) 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, 373408781120 + ... + 373408781181.
It is an arithmetic number, because the mean of its divisors is an integer number (5974540498416).
Almost surely, 223151344431331 is an apocalyptic number.
23151344431331 is a deficient number, since it is larger than the sum of its proper divisors (746817562333).
23151344431331 is an equidigital number, since it uses as much as digits as its factorization.
23151344431331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 746817562332.
The product of its digits is 155520, while the sum is 38.
Adding to 23151344431331 its reverse (13313444315132), we get a palindrome (36464788746463).
The spelling of 23151344431331 in words is "twenty-three trillion, one hundred fifty-one billion, three hundred forty-four million, four hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •