Base | Representation |
---|---|
bin | 111001011110001101… |
… | …0011100110000011111 |
3 | 102210120100202102221001 |
4 | 1302330122130300133 |
5 | 4010231023300211 |
6 | 132410505451131 |
7 | 11626315555546 |
oct | 1627432346037 |
9 | 383510672831 |
10 | 123420134431 |
11 | 483844a2800 |
12 | 1bb051a0aa7 |
13 | b83b93c859 |
14 | 5d8b67515d |
15 | 3325388ac1 |
hex | 1cbc69cc1f |
123420134431 has 12 divisors (see below), whose sum is σ = 142800158200. Its totient is φ = 106294850640.
The previous prime is 123420134371. The next prime is 123420134449. The reversal of 123420134431 is 134431024321.
It is a happy number.
It is not a de Polignac number, because 123420134431 - 213 = 123420126239 is a prime.
It is a super-2 number, since 2×1234201344312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123420134431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123420134231) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26839836 + ... + 26844433.
Almost surely, 2123420134431 is an apocalyptic number.
123420134431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
123420134431 is a deficient number, since it is larger than the sum of its proper divisors (19380023769).
123420134431 is a wasteful number, since it uses less digits than its factorization.
123420134431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53684310 (or 53684299 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 123420134431 its reverse (134431024321), we get a palindrome (257851158752).
The spelling of 123420134431 in words is "one hundred twenty-three billion, four hundred twenty million, one hundred thirty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •