Base | Representation |
---|---|
bin | 1000111010001110010… |
… | …1101011000000011100 |
3 | 112122002121020020202120 |
4 | 2032203211223000130 |
5 | 10001441003321202 |
6 | 154152455222540 |
7 | 14026115035365 |
oct | 2164345530034 |
9 | 478077206676 |
10 | 153068417052 |
11 | 59a09149311 |
12 | 257ba377a50 |
13 | 11585199b55 |
14 | 75a10c6b6c |
15 | 3ead18a0bc |
hex | 23a396b01c |
153068417052 has 24 divisors (see below), whose sum is σ = 357266956032. Its totient is φ = 51007474800.
The previous prime is 153068417011. The next prime is 153068417059. The reversal of 153068417052 is 250714860351.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 153068416995 and 153068417013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153068417059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1874724 + ... + 1954667.
It is an arithmetic number, because the mean of its divisors is an integer number (14886123168).
Almost surely, 2153068417052 is an apocalyptic number.
153068417052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153068417052 is an abundant number, since it is smaller than the sum of its proper divisors (204198538980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153068417052 is a wasteful number, since it uses less digits than its factorization.
153068417052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3832729 (or 3832727 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 42.
The spelling of 153068417052 in words is "one hundred fifty-three billion, sixty-eight million, four hundred seventeen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •