Base | Representation |
---|---|
bin | 1001001110111000001110… |
… | …0100010011111010101010 |
3 | 1022221110001122000221010200 |
4 | 2103232003210103322222 |
5 | 2312304142023221011 |
6 | 33331223120253030 |
7 | 2065254400164441 |
oct | 223560344237252 |
9 | 38843048027120 |
10 | 10151215054506 |
11 | 3264119290649 |
12 | 117b459471176 |
13 | 588342370536 |
14 | 27147000bd58 |
15 | 1290ca533856 |
hex | 93b83913eaa |
10151215054506 has 12 divisors (see below), whose sum is σ = 21994299284802. Its totient is φ = 3383738351496.
The previous prime is 10151215054459. The next prime is 10151215054537. The reversal of 10151215054506 is 60545051215101.
10151215054506 is a `hidden beast` number, since 1 + 0 + 1 + 51 + 2 + 1 + 50 + 54 + 506 = 666.
10151215054506 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 8210752124481 + 1940462930025 = 2865441^2 + 1393005^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 281978195941 + ... + 281978195976.
Almost surely, 210151215054506 is an apocalyptic number.
10151215054506 is an abundant number, since it is smaller than the sum of its proper divisors (11843084230296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151215054506 is a wasteful number, since it uses less digits than its factorization.
10151215054506 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 563956391925 (or 563956391922 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 36.
Adding to 10151215054506 its reverse (60545051215101), we get a palindrome (70696266269607).
The spelling of 10151215054506 in words is "ten trillion, one hundred fifty-one billion, two hundred fifteen million, fifty-four thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •