Base | Representation |
---|---|
bin | 11101010000001010… |
… | …011101100100111101 |
3 | 10000001222212121210201 |
4 | 131100022131210331 |
5 | 1003311340102231 |
6 | 22232430403501 |
7 | 2161234652656 |
oct | 352012354475 |
9 | 100058777721 |
10 | 31409690941 |
11 | 12358a51772 |
12 | 6107060591 |
13 | 2c67457855 |
14 | 173d76052d |
15 | c3c785161 |
hex | 75029d93d |
31409690941 has 4 divisors (see below), whose sum is σ = 31410812092. Its totient is φ = 31408569792.
The previous prime is 31409690933. The next prime is 31409690999. The reversal of 31409690941 is 14909690413.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14909690413 = 48463 ⋅307651.
It can be written as a sum of positive squares in 2 ways, for example, as 24352850916 + 7056840025 = 156054^2 + 84005^2 .
It is a cyclic number.
It is not a de Polignac number, because 31409690941 - 23 = 31409690933 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31409690891 and 31409690900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31409660941) 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, 517446 + ... + 574951.
It is an arithmetic number, because the mean of its divisors is an integer number (7852703023).
Almost surely, 231409690941 is an apocalyptic number.
It is an amenable number.
31409690941 is a deficient number, since it is larger than the sum of its proper divisors (1121151).
31409690941 is a wasteful number, since it uses less digits than its factorization.
31409690941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1121150.
The product of its (nonzero) digits is 209952, while the sum is 46.
The spelling of 31409690941 in words is "thirty-one billion, four hundred nine million, six hundred ninety thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •