Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …010101000011011110000111 |
3 | 111020121121021001102100121200 |
4 | 112331300201111003132013 |
5 | 101214300032041200403 |
6 | 554451120135113543 |
7 | 30163040120456451 |
oct | 2675604125033607 |
9 | 436547231370550 |
10 | 101001010100103 |
11 | 2a200319124243 |
12 | b3b2809b128b3 |
13 | 444847b776c49 |
14 | 1ad26914752d1 |
15 | ba2404a5eca3 |
hex | 5bdc21543787 |
101001010100103 has 24 divisors (see below), whose sum is σ = 148650166166112. Its totient is φ = 66060367034688.
The previous prime is 101001010100099. The next prime is 101001010100113. The reversal of 101001010100103 is 301001010100101.
It is not a de Polignac number, because 101001010100103 - 22 = 101001010100099 is a prime.
It is a super-2 number, since 2×1010010101001032 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001010100113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4812150 + ... + 15005292.
It is an arithmetic number, because the mean of its divisors is an integer number (6193756923588).
Almost surely, 2101001010100103 is an apocalyptic number.
101001010100103 is a deficient number, since it is larger than the sum of its proper divisors (47649156066009).
101001010100103 is a wasteful number, since it uses less digits than its factorization.
101001010100103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10213975 (or 10213972 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 101001010100103 its reverse (301001010100101), we get a palindrome (402002020200204).
The spelling of 101001010100103 in words is "one hundred one trillion, one billion, ten million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •