Base | Representation |
---|---|
bin | 101101001110100111… |
… | …0000110100100000010 |
3 | 100021200221120211121020 |
4 | 1122131032012210002 |
5 | 3042404003002242 |
6 | 112341452410310 |
7 | 10005616611102 |
oct | 1323516064402 |
9 | 307627524536 |
10 | 97127000322 |
11 | 38211728a00 |
12 | 169a7776996 |
13 | 920b533531 |
14 | 49b5677202 |
15 | 27d6dd06ec |
hex | 169d386902 |
97127000322 has 96 divisors (see below), whose sum is σ = 215518605120. Its totient is φ = 29157744000.
The previous prime is 97127000297. The next prime is 97127000413. The reversal of 97127000322 is 22300072179.
97127000322 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 70740028 + ... + 70741400.
It is an arithmetic number, because the mean of its divisors is an integer number (2244985470).
Almost surely, 297127000322 is an apocalyptic number.
97127000322 is the 254463-rd pentagonal number.
It is a practical number, because each smaller number is the sum of distinct divisors of 97127000322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107759302560).
97127000322 is an abundant number, since it is smaller than the sum of its proper divisors (118391604798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97127000322 is a wasteful number, since it uses less digits than its factorization.
97127000322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2240 (or 2229 counting only the distinct ones).
The product of its (nonzero) digits is 10584, while the sum is 33.
The spelling of 97127000322 in words is "ninety-seven billion, one hundred twenty-seven million, three hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •