Base | Representation |
---|---|
bin | 101110101110011111010… |
… | …010100011101010100010 |
3 | 102100222012000110221110200 |
4 | 232232133102203222202 |
5 | 410102123312342010 |
6 | 10455041412410030 |
7 | 450662616160140 |
oct | 56563722435242 |
9 | 12328160427420 |
10 | 3211013012130 |
11 | 10288681529a0 |
12 | 43a395916916 |
13 | 1a3a496812b1 |
14 | b15b18b4590 |
15 | 587d4977cc0 |
hex | 2eb9f4a3aa2 |
3211013012130 has 192 divisors, whose sum is σ = 10630148825088. Its totient is φ = 653027172480.
The previous prime is 3211013012107. The next prime is 3211013012161. The reversal of 3211013012130 is 312103101123.
3211013012130 is a `hidden beast` number, since 321 + 1 + 0 + 130 + 1 + 213 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4603542 + ... + 5254961.
It is an arithmetic number, because the mean of its divisors is an integer number (55365358464).
Almost surely, 23211013012130 is an apocalyptic number.
3211013012130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3211013012130 is an abundant number, since it is smaller than the sum of its proper divisors (7419135812958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3211013012130 is a wasteful number, since it uses less digits than its factorization.
3211013012130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9858581 (or 9858578 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 3211013012130 its reverse (312103101123), we get a palindrome (3523116113253).
The spelling of 3211013012130 in words is "three trillion, two hundred eleven billion, thirteen million, twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •