Base | Representation |
---|---|
bin | 1001000110001000110100… |
… | …0010011110010100111011 |
3 | 1022102002110101011220122220 |
4 | 2101202031002132110323 |
5 | 2302324122311213201 |
6 | 33134230300215123 |
7 | 2051360226143352 |
oct | 221421502362473 |
9 | 38362411156586 |
10 | 10001050101051 |
11 | 3206470067529 |
12 | 115632b53a4a3 |
13 | 577130887aa9 |
14 | 2680a679c999 |
15 | 12523c21e036 |
hex | 9188d09e53b |
10001050101051 has 4 divisors (see below), whose sum is σ = 13334733468072. Its totient is φ = 6667366734032.
The previous prime is 10001050101019. The next prime is 10001050101067. The reversal of 10001050101051 is 15010105010001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10001050101051 - 25 = 10001050101019 is a prime.
It is a super-2 number, since 2×100010501010512 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10001050101051.
It is not an unprimeable number, because it can be changed into a prime (10001050101751) 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, 1666841683506 + ... + 1666841683511.
It is an arithmetic number, because the mean of its divisors is an integer number (3333683367018).
Almost surely, 210001050101051 is an apocalyptic number.
10001050101051 is a deficient number, since it is larger than the sum of its proper divisors (3333683367021).
10001050101051 is an equidigital number, since it uses as much as digits as its factorization.
10001050101051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3333683367020.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 10001050101051 its reverse (15010105010001), we get a palindrome (25011155111052).
The spelling of 10001050101051 in words is "ten trillion, one billion, fifty million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •