Base | Representation |
---|---|
bin | 10010110100100111… |
… | …00001010000101001 |
3 | 222002020100020102100 |
4 | 21122103201100221 |
5 | 131143340013001 |
6 | 4350413124013 |
7 | 505261043214 |
oct | 113223412051 |
9 | 28066306370 |
10 | 10105001001 |
11 | 43160118a7 |
12 | 1b60189609 |
13 | c50692344 |
14 | 6bc09677b |
15 | 3e21ee586 |
hex | 25a4e1429 |
10105001001 has 6 divisors (see below), whose sum is σ = 14596112570. Its totient is φ = 6736667328.
The previous prime is 10105000967. The next prime is 10105001017. The reversal of 10105001001 is 10010050101.
It can be written as a sum of positive squares in only one way, i.e., 9082280601 + 1022720400 = 95301^2 + 31980^2 .
It is a de Polignac number, because none of the positive numbers 2k-10105001001 is a prime.
It is a super-2 number, since 2×101050010012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1122777889 = 10105001001 / (1 + 0 + 1 + 0 + 5 + 0 + 0 + 1 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10105001201) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 561388936 + ... + 561388953.
Almost surely, 210105001001 is an apocalyptic number.
It is an amenable number.
10105001001 is a deficient number, since it is larger than the sum of its proper divisors (4491111569).
10105001001 is a wasteful number, since it uses less digits than its factorization.
10105001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1122777895 (or 1122777892 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 10105001001 its reverse (10010050101), we get a palindrome (20115051102).
The spelling of 10105001001 in words is "ten billion, one hundred five million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •