Base | Representation |
---|---|
bin | 11101001010101010000… |
… | …10010100011111010110 |
3 | 10112210201211122120200210 |
4 | 32211111002110133112 |
5 | 112404402414122132 |
6 | 2044214435150250 |
7 | 132255211613460 |
oct | 16452502243726 |
9 | 3483654576623 |
10 | 1002154051542 |
11 | 357013921786 |
12 | 142283445386 |
13 | 7366c62cc57 |
14 | 3670c563130 |
15 | 1b105908bcc |
hex | e9550947d6 |
1002154051542 has 192 divisors, whose sum is σ = 2475499461120. Its totient is φ = 264854016000.
The previous prime is 1002154051529. The next prime is 1002154051553. The reversal of 1002154051542 is 2451504512001.
1002154051542 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 170402442 + ... + 170408322.
It is an arithmetic number, because the mean of its divisors is an integer number (12893226360).
Almost surely, 21002154051542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002154051542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1237749730560).
1002154051542 is an abundant number, since it is smaller than the sum of its proper divisors (1473345409578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002154051542 is a wasteful number, since it uses less digits than its factorization.
1002154051542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6167 (or 6150 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 1002154051542 its reverse (2451504512001), we get a palindrome (3453658563543).
The spelling of 1002154051542 in words is "one trillion, two billion, one hundred fifty-four million, fifty-one thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •