Base | Representation |
---|---|
bin | 1001010001110001101110… |
… | …0100111101100001011010 |
3 | 1100010012120221000100121122 |
4 | 2110130123210331201122 |
5 | 2314113132030031020 |
6 | 33410140155005242 |
7 | 2101666352230502 |
oct | 224343344754132 |
9 | 40105527010548 |
10 | 10201010002010 |
11 | 328325122a723 |
12 | 1189035739822 |
13 | 58cc497a7309 |
14 | 273a35402a02 |
15 | 12a541dc2125 |
hex | 9471b93d85a |
10201010002010 has 16 divisors (see below), whose sum is σ = 18365462035200. Its totient is φ = 4079594216016.
The previous prime is 10201010001991. The next prime is 10201010002013. The reversal of 10201010002010 is 1020001010201.
10201010002010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×102010100020103 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10201010002013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101170190 + ... + 101270969.
It is an arithmetic number, because the mean of its divisors is an integer number (1147841377200).
Almost surely, 210201010002010 is an apocalyptic number.
10201010002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10201010002010 is a deficient number, since it is larger than the sum of its proper divisors (8164452033190).
10201010002010 is a wasteful number, since it uses less digits than its factorization.
10201010002010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202446205.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10201010002010 its reverse (1020001010201), we get a palindrome (11221011012211).
The spelling of 10201010002010 in words is "ten trillion, two hundred one billion, ten million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •