Base | Representation |
---|---|
bin | 11111010011101111110… |
… | …001001110000001110111 |
3 | 21121200102011200121001000 |
4 | 133103233301032001313 |
5 | 240222241103231033 |
6 | 4324215514534343 |
7 | 311304221564346 |
oct | 37235761160167 |
9 | 7550364617030 |
10 | 2151506305143 |
11 | 75a4a3246318 |
12 | 2a8b871373b3 |
13 | 127b69c02940 |
14 | 761c2305b5d |
15 | 3ae73e4ea13 |
hex | 1f4efc4e077 |
2151506305143 has 64 divisors (see below), whose sum is σ = 3467052610560. Its totient is φ = 1310764291200.
The previous prime is 2151506305121. The next prime is 2151506305189. The reversal of 2151506305143 is 3415036051512.
2151506305143 is a `hidden beast` number, since 2 + 1 + 5 + 1 + 5 + 0 + 630 + 5 + 14 + 3 = 666.
It is not a de Polignac number, because 2151506305143 - 225 = 2151472750711 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2151506305098 and 2151506305107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2151506301143) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 19302430 + ... + 19413572.
It is an arithmetic number, because the mean of its divisors is an integer number (54172697040).
Almost surely, 22151506305143 is an apocalyptic number.
2151506305143 is a deficient number, since it is larger than the sum of its proper divisors (1315546305417).
2151506305143 is a wasteful number, since it uses less digits than its factorization.
2151506305143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111717 (or 111711 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 2151506305143 in words is "two trillion, one hundred fifty-one billion, five hundred six million, three hundred five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •