Base | Representation |
---|---|
bin | 10111001000110100… |
… | …10010011111011011 |
3 | 1012001201020120111012 |
4 | 23210122102133123 |
5 | 200420020000243 |
6 | 5412343124135 |
7 | 616554344522 |
oct | 134432223733 |
9 | 35051216435 |
10 | 12422031323 |
11 | 52a4a04a99 |
12 | 24a814364b |
13 | 122c71acc0 |
14 | 85bab94b9 |
15 | 4ca836d18 |
hex | 2e46927db |
12422031323 has 4 divisors (see below), whose sum is σ = 13377572208. Its totient is φ = 11466490440.
The previous prime is 12422031269. The next prime is 12422031331. The reversal of 12422031323 is 32313022421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32313022421 = 359 ⋅90008419.
It is a cyclic number.
It is not a de Polignac number, because 12422031323 - 28 = 12422031067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12422031373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 477770423 + ... + 477770448.
It is an arithmetic number, because the mean of its divisors is an integer number (3344393052).
Almost surely, 212422031323 is an apocalyptic number.
12422031323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12422031323 is a deficient number, since it is larger than the sum of its proper divisors (955540885).
12422031323 is an equidigital number, since it uses as much as digits as its factorization.
12422031323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 955540884.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 12422031323 its reverse (32313022421), we get a palindrome (44735053744).
The spelling of 12422031323 in words is "twelve billion, four hundred twenty-two million, thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •