Base | Representation |
---|---|
bin | 101111000010101110… |
… | …1011000000110111010 |
3 | 100122202111012022021100 |
4 | 1132011131120012322 |
5 | 3123343432142313 |
6 | 114224240152230 |
7 | 10204311016146 |
oct | 1360535300672 |
9 | 318674168240 |
10 | 101023318458 |
11 | 39931036437 |
12 | 176b4608676 |
13 | 96ac82261a |
14 | 4c64d1c226 |
15 | 2963ec5173 |
hex | 17857581ba |
101023318458 has 12 divisors (see below), whose sum is σ = 218883856698. Its totient is φ = 33674439480.
The previous prime is 101023318423. The next prime is 101023318481. The reversal of 101023318458 is 854813320101.
101023318458 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 90813630609 + 10209687849 = 301353^2 + 101043^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2806203273 + ... + 2806203308.
Almost surely, 2101023318458 is an apocalyptic number.
101023318458 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
101023318458 is an abundant number, since it is smaller than the sum of its proper divisors (117860538240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101023318458 is a wasteful number, since it uses less digits than its factorization.
101023318458 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5612406589 (or 5612406586 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
Adding to 101023318458 its reverse (854813320101), we get a palindrome (955836638559).
The spelling of 101023318458 in words is "one hundred one billion, twenty-three million, three hundred eighteen thousand, four hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •