Base | Representation |
---|---|
bin | 11101010000111010… |
… | …111101011101000111 |
3 | 10000002212210112102102 |
4 | 131100322331131013 |
5 | 1003323113420143 |
6 | 22234003102315 |
7 | 2161451013344 |
oct | 352072753507 |
9 | 100085715372 |
10 | 31422404423 |
11 | 12365145583 |
12 | 610b37199b |
13 | 2c69c89517 |
14 | 174130d7cb |
15 | c3d9470b8 |
hex | 750ebd747 |
31422404423 has 4 divisors (see below), whose sum is σ = 32505935640. Its totient is φ = 30338873208.
The previous prime is 31422404407. The next prime is 31422404441. The reversal of 31422404423 is 32440422413.
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 31422404423 - 24 = 31422404407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 1083531187 = 31422404423 / (3 + 1 + 4 + 2 + 2 + 4 + 0 + 4 + 4 + 2 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31422404723) 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, 541765565 + ... + 541765622.
It is an arithmetic number, because the mean of its divisors is an integer number (8126483910).
Almost surely, 231422404423 is an apocalyptic number.
31422404423 is a deficient number, since it is larger than the sum of its proper divisors (1083531217).
31422404423 is a wasteful number, since it uses less digits than its factorization.
31422404423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083531216.
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 31422404423 its reverse (32440422413), we get a palindrome (63862826836).
The spelling of 31422404423 in words is "thirty-one billion, four hundred twenty-two million, four hundred four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •