Base | Representation |
---|---|
bin | 101101001000001110000… |
… | …110101011111000010100 |
3 | 101222110202011121102201110 |
4 | 231020032012223320110 |
5 | 401302230433140312 |
6 | 10332401211255020 |
7 | 440024462513313 |
oct | 55101606537024 |
9 | 11873664542643 |
10 | 3101203021332 |
11 | a96238291589 |
12 | 42104a74a470 |
13 | 196599651090 |
14 | aa155a3227a |
15 | 55a093b443c |
hex | 2d20e1abe14 |
3101203021332 has 48 divisors (see below), whose sum is σ = 7792879191552. Its totient is φ = 954202523520.
The previous prime is 3101203021327. The next prime is 3101203021339. The reversal of 3101203021332 is 2331203021013.
It is a junction number, because it is equal to n+sod(n) for n = 3101203021299 and 3101203021308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101203021339) by changing a digit.
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, 18032413 + ... + 18203579.
It is an arithmetic number, because the mean of its divisors is an integer number (162351649824).
Almost surely, 23101203021332 is an apocalyptic number.
It is an amenable number.
3101203021332 is an abundant number, since it is smaller than the sum of its proper divisors (4691676170220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3101203021332 is a wasteful number, since it uses less digits than its factorization.
3101203021332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287328 (or 287326 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 3101203021332 its reverse (2331203021013), we get a palindrome (5432406042345).
The spelling of 3101203021332 in words is "three trillion, one hundred one billion, two hundred three million, twenty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •