Base | Representation |
---|---|
bin | 10010111001010001… |
… | …10111011101101000 |
3 | 222011222000021200010 |
4 | 21130220313131220 |
5 | 131233400321100 |
6 | 4354332211520 |
7 | 506244602265 |
oct | 113450673550 |
9 | 28158007603 |
10 | 10144151400 |
11 | 43361220a9 |
12 | 1b71309ba0 |
13 | c5881c266 |
14 | 6c336826c |
15 | 3e5884750 |
hex | 25ca37768 |
10144151400 has 96 divisors (see below), whose sum is σ = 31564274400. Its totient is φ = 2695008000.
The previous prime is 10144151393. The next prime is 10144151419. The reversal of 10144151400 is 415144101.
It is a super-2 number, since 2×101441514002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 129975 + ... + 192825.
It is an arithmetic number, because the mean of its divisors is an integer number (328794525).
Almost surely, 210144151400 is an apocalyptic number.
10144151400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10144151400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15782137200).
10144151400 is an abundant number, since it is smaller than the sum of its proper divisors (21420123000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10144151400 is a wasteful number, since it uses less digits than its factorization.
10144151400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63139 (or 63130 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 10144151400 its reverse (415144101), we get a palindrome (10559295501).
The spelling of 10144151400 in words is "ten billion, one hundred forty-four million, one hundred fifty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •