Base | Representation |
---|---|
bin | 11101000110110101011… |
… | …11100011110000110101 |
3 | 10112121102211221110112220 |
4 | 32203122233203300311 |
5 | 112341202143004023 |
6 | 2043235103232553 |
7 | 132153316253466 |
oct | 16433257436065 |
9 | 3477384843486 |
10 | 1000102313013 |
11 | 356160757201 |
12 | 1419b02a8759 |
13 | 7340353c09b |
14 | 36595c7ad6d |
15 | 1b0357263e3 |
hex | e8dabe3c35 |
1000102313013 has 8 divisors (see below), whose sum is σ = 1333474396800. Its totient is φ = 666732552288.
The previous prime is 1000102312973. The next prime is 1000102313027. The reversal of 1000102313013 is 3103132010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000102313013 - 26 = 1000102312949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000102312983 and 1000102313001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000102313033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1232793 + ... + 1876161.
It is an arithmetic number, because the mean of its divisors is an integer number (166684299600).
Almost surely, 21000102313013 is an apocalyptic number.
It is an amenable number.
1000102313013 is a deficient number, since it is larger than the sum of its proper divisors (333372083787).
1000102313013 is an equidigital number, since it uses as much as digits as its factorization.
1000102313013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1161531.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1000102313013 its reverse (3103132010001), we get a palindrome (4103234323014).
The spelling of 1000102313013 in words is "one trillion, one hundred two million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •