Base | Representation |
---|---|
bin | 11100000100010001… |
… | …11100110001100011 |
3 | 1102220010122020112120 |
4 | 32002020330301203 |
5 | 221324440123201 |
6 | 10531113355323 |
7 | 1042256214060 |
oct | 160210746143 |
9 | 42803566476 |
10 | 15068286051 |
11 | 6432722375 |
12 | 2b06408b43 |
13 | 1561a376c0 |
14 | a2d31bc67 |
15 | 5d2d02536 |
hex | 38223cc63 |
15068286051 has 128 divisors (see below), whose sum is σ = 26057687040. Its totient is φ = 7535808000.
The previous prime is 15068286047. The next prime is 15068286067.
15068286051 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 15068286051 - 22 = 15068286047 is a prime.
It is a super-2 number, since 2×150682860512 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15068285994 and 15068286012.
It is not an unprimeable number, because it can be changed into a prime (15068286071) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 84180280 + ... + 84180458.
It is an arithmetic number, because the mean of its divisors is an integer number (203575680).
Almost surely, 215068286051 is an apocalyptic number.
15068286051 is a deficient number, since it is larger than the sum of its proper divisors (10989400989).
15068286051 is a wasteful number, since it uses less digits than its factorization.
15068286051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417.
The product of its (nonzero) digits is 115200, while the sum is 42.
The spelling of 15068286051 in words is "fifteen billion, sixty-eight million, two hundred eighty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •