Base | Representation |
---|---|
bin | 1000100111001110101… |
… | …0011101001001010101 |
3 | 112010221020112012200101 |
4 | 2021303222131021111 |
5 | 4411020131203313 |
6 | 151550505414101 |
7 | 13455551060602 |
oct | 2116352351125 |
9 | 463836465611 |
10 | 147969397333 |
11 | 5783195a32a |
12 | 2481679a331 |
13 | 10c5197ba14 |
14 | 7239c0b6a9 |
15 | 3cb06c45dd |
hex | 2273a9d255 |
147969397333 has 8 divisors (see below), whose sum is σ = 150504688800. Its totient is φ = 145435017168.
The previous prime is 147969397327. The next prime is 147969397369. The reversal of 147969397333 is 333793969741.
147969397333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 147969397333 - 233 = 139379462741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147969397393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103798 + ... + 553816.
It is an arithmetic number, because the mean of its divisors is an integer number (18813086100).
Almost surely, 2147969397333 is an apocalyptic number.
It is an amenable number.
147969397333 is a deficient number, since it is larger than the sum of its proper divisors (2535291467).
147969397333 is an equidigital number, since it uses as much as digits as its factorization.
147969397333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455651.
The product of its digits is 69441624, while the sum is 64.
The spelling of 147969397333 in words is "one hundred forty-seven billion, nine hundred sixty-nine million, three hundred ninety-seven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •