Base | Representation |
---|---|
bin | 11101111111001001000… |
… | …01011000110011000000 |
3 | 10122111110112211001100012 |
4 | 32333210201120303000 |
5 | 113340104233010222 |
6 | 2105154432044052 |
7 | 134303365125314 |
oct | 16774441306300 |
9 | 3574415731305 |
10 | 1030331141312 |
11 | 367a63083330 |
12 | 147827993628 |
13 | 76210143035 |
14 | 37c2284db44 |
15 | 1bc044a11e2 |
hex | efe4858cc0 |
1030331141312 has 112 divisors (see below), whose sum is σ = 2362148013312. Its totient is φ = 441283476480.
The previous prime is 1030331141291. The next prime is 1030331141377. The reversal of 1030331141312 is 2131411330301.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 609998 + ... + 1559730.
Almost surely, 21030331141312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1030331141312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1181074006656).
1030331141312 is an abundant number, since it is smaller than the sum of its proper divisors (1331816872000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030331141312 is a wasteful number, since it uses less digits than its factorization.
1030331141312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949846 (or 949836 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1030331141312 its reverse (2131411330301), we get a palindrome (3161742471613).
The spelling of 1030331141312 in words is "one trillion, thirty billion, three hundred thirty-one million, one hundred forty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •