Base | Representation |
---|---|
bin | 1100100011000001110… |
… | …01001001101010011011 |
3 | 1112012210122201020122001 |
4 | 12101200321021222123 |
5 | 24030414303332443 |
6 | 530015503341431 |
7 | 43101420201601 |
oct | 6214071115233 |
9 | 1465718636561 |
10 | 431122324123 |
11 | 156924349127 |
12 | 6b679bb1877 |
13 | 3186839c34a |
14 | 16c1b6bb871 |
15 | b333d17d4d |
hex | 6460e49a9b |
431122324123 has 4 divisors (see below), whose sum is σ = 441148424728. Its totient is φ = 421096223520.
The previous prime is 431122324049. The next prime is 431122324211. The reversal of 431122324123 is 321423221134.
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 431122324123 - 213 = 431122315931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 431122324091 and 431122324100.
It is not an unprimeable number, because it can be changed into a prime (431122324823) 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, 5013050238 + ... + 5013050323.
It is an arithmetic number, because the mean of its divisors is an integer number (110287106182).
Almost surely, 2431122324123 is an apocalyptic number.
431122324123 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
431122324123 is a deficient number, since it is larger than the sum of its proper divisors (10026100605).
431122324123 is a wasteful number, since it uses less digits than its factorization.
431122324123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10026100604.
The product of its digits is 6912, while the sum is 28.
Adding to 431122324123 its reverse (321423221134), we get a palindrome (752545545257).
The spelling of 431122324123 in words is "four hundred thirty-one billion, one hundred twenty-two million, three hundred twenty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •