Base | Representation |
---|---|
bin | 100100100000011010000010… |
… | …0001100001110111010111111 |
3 | 1120002222010120000011002021020 |
4 | 1021000310010030032322333 |
5 | 314042110014322414101 |
6 | 3054541225201235223 |
7 | 124431445633212123 |
oct | 11100640414167277 |
9 | 1502863500132236 |
10 | 321113300201151 |
11 | 93353427614527 |
12 | 30021aaa632b13 |
13 | 10a23b14b04013 |
14 | 5941d7670d583 |
15 | 271cd61b46136 |
hex | 1240d0430eebf |
321113300201151 has 32 divisors (see below), whose sum is σ = 433407328155648. Its totient is φ = 211464326193120.
The previous prime is 321113300201131. The next prime is 321113300201203. The reversal of 321113300201151 is 151102003311123.
It is not a de Polignac number, because 321113300201151 - 222 = 321113296006847 is a prime.
It is a super-3 number, since 3×3211133002011513 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321113300201131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 87852640 + ... + 91434746.
It is an arithmetic number, because the mean of its divisors is an integer number (13543979004864).
Almost surely, 2321113300201151 is an apocalyptic number.
321113300201151 is a deficient number, since it is larger than the sum of its proper divisors (112294027954497).
321113300201151 is a wasteful number, since it uses less digits than its factorization.
321113300201151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3583291.
The product of its (nonzero) digits is 540, while the sum is 24.
Adding to 321113300201151 its reverse (151102003311123), we get a palindrome (472215303512274).
The spelling of 321113300201151 in words is "three hundred twenty-one trillion, one hundred thirteen billion, three hundred million, two hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •