Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1001111000011100101010 |
3 | 1022102002100120220122112212 |
4 | 2101202022221320130222 |
5 | 2302324032041200020 |
6 | 33134222311005122 |
7 | 2051356232142266 |
oct | 221421251703452 |
9 | 38362316818485 |
10 | 10001010100010 |
11 | 320644a526116 |
12 | 115631a0697a2 |
13 | 5771254c0937 |
14 | 2680a13490a6 |
15 | 12523896bcc5 |
hex | 9188aa7872a |
10001010100010 has 64 divisors (see below), whose sum is σ = 18512840037888. Its totient is φ = 3887611200000.
The previous prime is 10001010099943. The next prime is 10001010100033. The reversal of 10001010100010 is 1000101010001.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10001010099967 and 10001010100003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1010096060 + ... + 1010105960.
It is an arithmetic number, because the mean of its divisors is an integer number (289263125592).
Almost surely, 210001010100010 is an apocalyptic number.
10001010100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10001010100010 is a deficient number, since it is larger than the sum of its proper divisors (8511829937878).
10001010100010 is a wasteful number, since it uses less digits than its factorization.
10001010100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19311.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10001010100010 its reverse (1000101010001), we get a palindrome (11001111110011).
Subtracting from 10001010100010 its reverse (1000101010001), we obtain a palindrome (9000909090009).
The spelling of 10001010100010 in words is "ten trillion, one billion, ten million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •