Base | Representation |
---|---|
bin | 11101011001010010100… |
… | …10011000111100110010 |
3 | 10120120000100000011200022 |
4 | 32230221102120330302 |
5 | 113022000030014302 |
6 | 2051554151323442 |
7 | 132653663234006 |
oct | 16545122307462 |
9 | 3516010004608 |
10 | 1010010001202 |
11 | 35a385350a64 |
12 | 1438b6380582 |
13 | 74322078287 |
14 | 36c55a50706 |
15 | 1b41544c8a2 |
hex | eb29498f32 |
1010010001202 has 8 divisors (see below), whose sum is σ = 1515078758700. Its totient is φ = 504983748304.
The previous prime is 1010010001103. The next prime is 1010010001207. The reversal of 1010010001202 is 2021000100101.
1010010001202 is digitally balanced in base 2, 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 2 ways, for example, as 987501300361 + 22508700841 = 993731^2 + 150029^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×10100100012023 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1010010001202.
It is not an unprimeable number, because it can be changed into a prime (1010010001207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10566677 + ... + 10661832.
Almost surely, 21010010001202 is an apocalyptic number.
1010010001202 is a deficient number, since it is larger than the sum of its proper divisors (505068757498).
1010010001202 is a wasteful number, since it uses less digits than its factorization.
1010010001202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21252300.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1010010001202 its reverse (2021000100101), we get a palindrome (3031010101303).
The spelling of 1010010001202 in words is "one trillion, ten billion, ten million, one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •