Base | Representation |
---|---|
bin | 1000110011101001010… |
… | …1110111100110010011 |
3 | 112110112112122211120021 |
4 | 2030322111313212103 |
5 | 4434331440313033 |
6 | 153301341124311 |
7 | 13634264306122 |
oct | 2147225674623 |
9 | 473475584507 |
10 | 151302666643 |
11 | 59192457957 |
12 | 253a6b59697 |
13 | 1136340c11b |
14 | 74747a7ab9 |
15 | 3e08149b2d |
hex | 233a577993 |
151302666643 has 4 divisors (see below), whose sum is σ = 153867118680. Its totient is φ = 148738214608.
The previous prime is 151302666629. The next prime is 151302666649. The reversal of 151302666643 is 346666203151.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 346666203151 = 97 ⋅3573878383.
It is a cyclic number.
It is not a de Polignac number, because 151302666643 - 29 = 151302666131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 151302666643.
It is not an unprimeable number, because it can be changed into a prime (151302666649) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1282225930 + ... + 1282226047.
It is an arithmetic number, because the mean of its divisors is an integer number (38466779670).
Almost surely, 2151302666643 is an apocalyptic number.
151302666643 is a deficient number, since it is larger than the sum of its proper divisors (2564452037).
151302666643 is an equidigital number, since it uses as much as digits as its factorization.
151302666643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564452036.
The product of its (nonzero) digits is 466560, while the sum is 43.
Adding to 151302666643 its reverse (346666203151), we get a palindrome (497968869794).
The spelling of 151302666643 in words is "one hundred fifty-one billion, three hundred two million, six hundred sixty-six thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •