Base | Representation |
---|---|
bin | 11101001011011011… |
… | …000000101100100100 |
3 | 2222212110012011120010 |
4 | 131023123000230210 |
5 | 1003131004034022 |
6 | 22220505410220 |
7 | 2156250551550 |
oct | 351333005444 |
9 | 88773164503 |
10 | 31330143012 |
11 | 1231805a183 |
12 | 60a4499970 |
13 | 2c53b2517c |
14 | 1732d74860 |
15 | c357c050c |
hex | 74b6c0b24 |
31330143012 has 48 divisors (see below), whose sum is σ = 83589835392. Its totient is φ = 8946885120.
The previous prime is 31330142983. The next prime is 31330143017. The reversal of 31330143012 is 21034103313.
It is a super-3 number, since 3×313301430123 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 31330143012.
It is not an unprimeable number, because it can be changed into a prime (31330143017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71212 + ... + 260252.
It is an arithmetic number, because the mean of its divisors is an integer number (1741454904).
Almost surely, 231330143012 is an apocalyptic number.
It is an amenable number.
31330143012 is an abundant number, since it is smaller than the sum of its proper divisors (52259692380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31330143012 is a wasteful number, since it uses less digits than its factorization.
31330143012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191028 (or 191026 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31330143012 its reverse (21034103313), we get a palindrome (52364246325).
The spelling of 31330143012 in words is "thirty-one billion, three hundred thirty million, one hundred forty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •