Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …010001101001000000010 |
3 | 10220100111010000111222001 |
4 | 100002111002031020002 |
5 | 121023410033323020 |
6 | 2202131325534214 |
7 | 142421612352601 |
oct | 20022502151002 |
9 | 3810433014861 |
10 | 1102012011010 |
11 | 3953a7061709 |
12 | 1596b171436a |
13 | 7cbc4899631 |
14 | 3b4a27aba38 |
15 | 1d9ec43750a |
hex | 1009508d202 |
1102012011010 has 16 divisors (see below), whose sum is σ = 2003261439672. Its totient is φ = 436440400000.
The previous prime is 1102012010933. The next prime is 1102012011041. The reversal of 1102012011010 is 101102102011.
It can be written as a sum of positive squares in 4 ways, for example, as 895686209649 + 206325801361 = 946407^2 + 454231^2 .
It is a super-2 number, since 2×11020120110102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 545549491 + ... + 545551510.
Almost surely, 21102012011010 is an apocalyptic number.
1102012011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102012011010 is a deficient number, since it is larger than the sum of its proper divisors (901249428662).
1102012011010 is a wasteful number, since it uses less digits than its factorization.
1102012011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091101109.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1102012011010 its reverse (101102102011), we get a palindrome (1203114113021).
The spelling of 1102012011010 in words is "one trillion, one hundred two billion, twelve million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •