Base | Representation |
---|---|
bin | 10110111101111000111010… |
… | …010111000110010011110010 |
3 | 111020122110111222010202010021 |
4 | 112331320322113012103302 |
5 | 101214422010110013020 |
6 | 554455210152354054 |
7 | 30163506313405231 |
oct | 2675707227062362 |
9 | 436573458122107 |
10 | 101010020001010 |
11 | 2a204121a6813a |
12 | b3b45033a592a |
13 | 44492862b2963 |
14 | 1ad2ca7d06b18 |
15 | ba2780a451aa |
hex | 5bde3a5c64f2 |
101010020001010 has 8 divisors (see below), whose sum is σ = 181818036001836. Its totient is φ = 40404008000400.
The previous prime is 101010020000951. The next prime is 101010020001061. The reversal of 101010020001010 is 10100020010101.
It can be written as a sum of positive squares in 2 ways, for example, as 99652522377321 + 1357497623689 = 9982611^2 + 1165117^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101010020000984 and 101010020001002.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5050501000041 + ... + 5050501000060.
Almost surely, 2101010020001010 is an apocalyptic number.
101010020001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101010020001010 is a deficient number, since it is larger than the sum of its proper divisors (80808016000826).
101010020001010 is a wasteful number, since it uses less digits than its factorization.
101010020001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10101002000108.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101010020001010 its reverse (10100020010101), we get a palindrome (111110040011111).
Subtracting from 101010020001010 its reverse (10100020010101), we obtain a palindrome (90909999990909).
The spelling of 101010020001010 in words is "one hundred one trillion, ten billion, twenty million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •