Base | Representation |
---|---|
bin | 1010100011101000001111… |
… | …11100001011010101100011 |
3 | 10001012021111122100002221201 |
4 | 11101310013330023111203 |
5 | 11020321123422403332 |
6 | 121212321303502031 |
7 | 4614121152362425 |
oct | 521640774132543 |
9 | 101167448302851 |
10 | 23214431450467 |
11 | 744020439a284 |
12 | 272b142157917 |
13 | cc515ac454ba |
14 | 5a3827b3c815 |
15 | 2a3cd99a95e7 |
hex | 151d07f0b563 |
23214431450467 has 8 divisors (see below), whose sum is σ = 24015167863200. Its totient is φ = 22413710956224.
The previous prime is 23214431450461. The next prime is 23214431450471. The reversal of 23214431450467 is 76405413441232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23214431450467 - 239 = 22664675636579 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23214431450461) 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 7 ways as a sum of consecutive naturals, for example, 974178 + ... + 6883159.
It is an arithmetic number, because the mean of its divisors is an integer number (3001895982900).
Almost surely, 223214431450467 is an apocalyptic number.
23214431450467 is a deficient number, since it is larger than the sum of its proper divisors (800736412733).
23214431450467 is a wasteful number, since it uses less digits than its factorization.
23214431450467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7959245.
The product of its (nonzero) digits is 1935360, while the sum is 46.
Adding to 23214431450467 its reverse (76405413441232), we get a palindrome (99619844891699).
The spelling of 23214431450467 in words is "twenty-three trillion, two hundred fourteen billion, four hundred thirty-one million, four hundred fifty thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •