Base | Representation |
---|---|
bin | 100100011111101010100011… |
… | …0010110101001011000100010 |
3 | 1120002121101100121010120111211 |
4 | 1020333111012112221120202 |
5 | 314033422201214342010 |
6 | 3054422323011500334 |
7 | 124421206015335553 |
oct | 11077250626513042 |
9 | 1502541317116454 |
10 | 321011331012130 |
11 | 93314160676590 |
12 | 300061912b76aa |
13 | 10a17314347395 |
14 | 593b061d3432a |
15 | 271a394ad308a |
hex | 123f5465a9622 |
321011331012130 has 64 divisors (see below), whose sum is σ = 631221654660480. Its totient is φ = 116569993305600.
The previous prime is 321011331012103. The next prime is 321011331012131. The reversal of 321011331012130 is 31210133110123.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (321011331012131) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 241880206 + ... + 243203734.
It is an arithmetic number, because the mean of its divisors is an integer number (9862838354070).
Almost surely, 2321011331012130 is an apocalyptic number.
321011331012130 is a deficient number, since it is larger than the sum of its proper divisors (310210323648350).
321011331012130 is a wasteful number, since it uses less digits than its factorization.
321011331012130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1326595.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 321011331012130 its reverse (31210133110123), we get a palindrome (352221464122253).
It can be divided in two parts, 3210113 and 31012130, that added together give a palindrome (34222243).
The spelling of 321011331012130 in words is "three hundred twenty-one trillion, eleven billion, three hundred thirty-one million, twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •