Base | Representation |
---|---|
bin | 1000110001110000010… |
… | …0110111000110000100 |
3 | 112102020011012012020010 |
4 | 2030130010313012010 |
5 | 4432311443013102 |
6 | 153135121510220 |
7 | 13615560300426 |
oct | 2143404670604 |
9 | 472204165203 |
10 | 150794891652 |
11 | 58a5186aaa9 |
12 | 25284aa2370 |
13 | 112b2164152 |
14 | 742718a816 |
15 | 3dc8797d6c |
hex | 231c137184 |
150794891652 has 12 divisors (see below), whose sum is σ = 351854747216. Its totient is φ = 50264963880.
The previous prime is 150794891573. The next prime is 150794891659. The reversal of 150794891652 is 256198497051.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 150794891592 and 150794891601.
It is not an unprimeable number, because it can be changed into a prime (150794891659) 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, 6283120474 + ... + 6283120497.
Almost surely, 2150794891652 is an apocalyptic number.
150794891652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
150794891652 is an abundant number, since it is smaller than the sum of its proper divisors (201059855564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150794891652 is a wasteful number, since it uses less digits than its factorization.
150794891652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12566240978 (or 12566240976 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 57.
The spelling of 150794891652 in words is "one hundred fifty billion, seven hundred ninety-four million, eight hundred ninety-one thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •