Base | Representation |
---|---|
bin | 111100101000011101… |
… | …1001010101111001011 |
3 | 110110002022220000211010 |
4 | 1321100323022233023 |
5 | 4113130404103020 |
6 | 135452141335003 |
7 | 12256433513415 |
oct | 1712073125713 |
9 | 413068800733 |
10 | 130206706635 |
11 | 50247322965 |
12 | 21299b67463 |
13 | c380969655 |
14 | 6432b159b5 |
15 | 35c1094de0 |
hex | 1e50ecabcb |
130206706635 has 16 divisors (see below), whose sum is σ = 213175632384. Its totient is φ = 67828609632.
The previous prime is 130206706603. The next prime is 130206706639. The reversal of 130206706635 is 536607602031.
It is not a de Polignac number, because 130206706635 - 25 = 130206706603 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130206706593 and 130206706602.
It is not an unprimeable number, because it can be changed into a prime (130206706639) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100934787 + ... + 100936076.
It is an arithmetic number, because the mean of its divisors is an integer number (13323477024).
Almost surely, 2130206706635 is an apocalyptic number.
130206706635 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130206706635 is a deficient number, since it is larger than the sum of its proper divisors (82968925749).
130206706635 is a wasteful number, since it uses less digits than its factorization.
130206706635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201870914.
The product of its (nonzero) digits is 136080, while the sum is 39.
The spelling of 130206706635 in words is "one hundred thirty billion, two hundred six million, seven hundred six thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •