Base | Representation |
---|---|
bin | 101111111111011101… |
… | …1100011000010001011 |
3 | 100212000111222000010210 |
4 | 1133332323203002023 |
5 | 3142032141130132 |
6 | 115202400412203 |
7 | 10305645226605 |
oct | 1377673430213 |
9 | 325014860123 |
10 | 103061270667 |
11 | 3a787445063 |
12 | 17b83017063 |
13 | 9945ac73c4 |
14 | 4db9856175 |
15 | 2a32d82bcc |
hex | 17feee308b |
103061270667 has 16 divisors (see below), whose sum is σ = 138841477632. Its totient is φ = 67997148960.
The previous prime is 103061270633. The next prime is 103061270677. The reversal of 103061270667 is 766072160301.
It is not a de Polignac number, because 103061270667 - 222 = 103057076363 is a prime.
It is a super-2 number, since 2×1030612706672 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103061270677) 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 15 ways as a sum of consecutive naturals, for example, 213048 + ... + 501509.
It is an arithmetic number, because the mean of its divisors is an integer number (8677592352).
Almost surely, 2103061270667 is an apocalyptic number.
103061270667 is a deficient number, since it is larger than the sum of its proper divisors (35780206965).
103061270667 is a wasteful number, since it uses less digits than its factorization.
103061270667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715058.
The product of its (nonzero) digits is 63504, while the sum is 39.
The spelling of 103061270667 in words is "one hundred three billion, sixty-one million, two hundred seventy thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •