Base | Representation |
---|---|
bin | 101111001011000100… |
… | …1011110011001010000 |
3 | 100200111000001112221121 |
4 | 1132112021132121100 |
5 | 3124432122022000 |
6 | 114312121332024 |
7 | 10214250650530 |
oct | 1362611363120 |
9 | 320430045847 |
10 | 101303314000 |
11 | 39a65097209 |
12 | 17772337014 |
13 | 9725837c65 |
14 | 4c901a54c0 |
15 | 297d881b1a |
hex | 179625e650 |
101303314000 has 80 divisors (see below), whose sum is σ = 279944510976. Its totient is φ = 34732560000.
The previous prime is 101303313977. The next prime is 101303314001. The reversal of 101303314000 is 413303101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1013033140002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101303314001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3603976 + ... + 3631975.
Almost surely, 2101303314000 is an apocalyptic number.
101303314000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101303314000 is an abundant number, since it is smaller than the sum of its proper divisors (178641196976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101303314000 is an equidigital number, since it uses as much as digits as its factorization.
101303314000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7235981 (or 7235965 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 101303314000 its reverse (413303101), we get a palindrome (101716617101).
The spelling of 101303314000 in words is "one hundred one billion, three hundred three million, three hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •