Base | Representation |
---|---|
bin | 11100111001100010… |
… | …000110110110001001 |
3 | 2222002112110000000122 |
4 | 130321202012312021 |
5 | 1002022140411241 |
6 | 22131024513025 |
7 | 2145644522066 |
oct | 347142066611 |
9 | 88075400018 |
10 | 31030013321 |
11 | 121836a730a |
12 | 601ba7b775 |
13 | 2c068b0338 |
14 | 1705169c6d |
15 | c1928804b |
hex | 739886d89 |
31030013321 has 4 divisors (see below), whose sum is σ = 31215821952. Its totient is φ = 30844204692.
The previous prime is 31030013291. The next prime is 31030013383. The reversal of 31030013321 is 12331003013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31030013321 - 26 = 31030013257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31030013321.
It is not an unprimeable number, because it can be changed into a prime (31030013821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92904065 + ... + 92904398.
It is an arithmetic number, because the mean of its divisors is an integer number (7803955488).
Almost surely, 231030013321 is an apocalyptic number.
It is an amenable number.
31030013321 is a deficient number, since it is larger than the sum of its proper divisors (185808631).
31030013321 is a wasteful number, since it uses less digits than its factorization.
31030013321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185808630.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 31030013321 its reverse (12331003013), we get a palindrome (43361016334).
The spelling of 31030013321 in words is "thirty-one billion, thirty million, thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •