Base | Representation |
---|---|
bin | 10000101111111101110… |
… | …110111110101011110101 |
3 | 11002000222020101100100210 |
4 | 100233331312332223311 |
5 | 122324234410104323 |
6 | 2240434044500033 |
7 | 146105142521610 |
oct | 20577566765365 |
9 | 4060866340323 |
10 | 1151015316213 |
11 | 404163159154 |
12 | 1670a884a619 |
13 | 84703cb8709 |
14 | 3d9d09b1177 |
15 | 1ee19550293 |
hex | 10bfddbeaf5 |
1151015316213 has 32 divisors (see below), whose sum is σ = 1791534551040. Its totient is φ = 643625133120.
The previous prime is 1151015316181. The next prime is 1151015316223. The reversal of 1151015316213 is 3126135101511.
It is not a de Polignac number, because 1151015316213 - 25 = 1151015316181 is a prime.
It is a super-2 number, since 2×11510153162132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151015316223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6246718 + ... + 6428336.
It is an arithmetic number, because the mean of its divisors is an integer number (55985454720).
Almost surely, 21151015316213 is an apocalyptic number.
It is an amenable number.
1151015316213 is a deficient number, since it is larger than the sum of its proper divisors (640519234827).
1151015316213 is a wasteful number, since it uses less digits than its factorization.
1151015316213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188097.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 1151015316213 in words is "one trillion, one hundred fifty-one billion, fifteen million, three hundred sixteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •