Base | Representation |
---|---|
bin | 1000011100100100010… |
… | …0011110110100100010 |
3 | 111212112210000102012010 |
4 | 2013021010132310202 |
5 | 4334134433103002 |
6 | 150354505213350 |
7 | 13324615556265 |
oct | 2071104366442 |
9 | 455483012163 |
10 | 145107316002 |
11 | 565a332a260 |
12 | 24158191256 |
13 | 108b6a2637c |
14 | 7047a66cdc |
15 | 3b942c546c |
hex | 21c911ed22 |
145107316002 has 64 divisors (see below), whose sum is σ = 333711498240. Its totient is φ = 41601268800.
The previous prime is 145107316001. The next prime is 145107316027. The reversal of 145107316002 is 200613701541.
It is a super-2 number, since 2×1451073160022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145107316001) 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, 853852 + ... + 1009592.
It is an arithmetic number, because the mean of its divisors is an integer number (5214242160).
Almost surely, 2145107316002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145107316002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166855749120).
145107316002 is an abundant number, since it is smaller than the sum of its proper divisors (188604182238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145107316002 is a wasteful number, since it uses less digits than its factorization.
145107316002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156519.
The product of its (nonzero) digits is 5040, while the sum is 30.
The spelling of 145107316002 in words is "one hundred forty-five billion, one hundred seven million, three hundred sixteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •