Base | Representation |
---|---|
bin | 1000110110001000000… |
… | …1000011111011111001 |
3 | 112112020221011112221221 |
4 | 2031202001003323321 |
5 | 4442212341111133 |
6 | 153451400032041 |
7 | 13656626146351 |
oct | 2154201037371 |
9 | 475227145857 |
10 | 151968300793 |
11 | 594a4164721 |
12 | 25551a62621 |
13 | 1143b2a829a |
14 | 74d8d57b61 |
15 | 3e467cea2d |
hex | 2362043ef9 |
151968300793 has 8 divisors (see below), whose sum is σ = 152300930760. Its totient is φ = 151635805440.
The previous prime is 151968300773. The next prime is 151968300817. The reversal of 151968300793 is 397003869151.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 19557463104 + 132410837689 = 139848^2 + 363883^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 151968300793 - 237 = 14529347321 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 151968300793.
It is not an unprimeable number, because it can be changed into a prime (151968300763) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2420863 + ... + 2482843.
It is an arithmetic number, because the mean of its divisors is an integer number (19037616345).
Almost surely, 2151968300793 is an apocalyptic number.
It is an amenable number.
151968300793 is a deficient number, since it is larger than the sum of its proper divisors (332629967).
151968300793 is an equidigital number, since it uses as much as digits as its factorization.
151968300793 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67307.
The product of its (nonzero) digits is 1224720, while the sum is 52.
The spelling of 151968300793 in words is "one hundred fifty-one billion, nine hundred sixty-eight million, three hundred thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •