Base | Representation |
---|---|
bin | 1001010010010011111111… |
… | …1100001011000001101001 |
3 | 1100011002100002102201200000 |
4 | 2110210333330023001221 |
5 | 2314241002230013001 |
6 | 33414301122533213 |
7 | 2102443344023133 |
oct | 224447774130151 |
9 | 40132302381600 |
10 | 10210210001001 |
11 | 328714240307a |
12 | 118a982807209 |
13 | 590a848112ba |
14 | 2742691da053 |
15 | 12a8ce907a86 |
hex | 9493ff0b069 |
10210210001001 has 48 divisors (see below), whose sum is σ = 15584820660864. Its totient is φ = 6677543867904.
The previous prime is 10210210000957. The next prime is 10210210001009. The reversal of 10210210001001 is 10010001201201.
It is a happy number.
10210210001001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10210210001001 - 223 = 10210201612393 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10210210001009) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 113380345 + ... + 113470361.
It is an arithmetic number, because the mean of its divisors is an integer number (324683763768).
Almost surely, 210210210001001 is an apocalyptic number.
It is an amenable number.
10210210001001 is a deficient number, since it is larger than the sum of its proper divisors (5374610659863).
10210210001001 is an frugal number, since it uses more digits than its factorization.
10210210001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98892 (or 98880 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10210210001001 its reverse (10010001201201), we get a palindrome (20220211202202).
The spelling of 10210210001001 in words is "ten trillion, two hundred ten billion, two hundred ten million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •