Base | Representation |
---|---|
bin | 100100011001100000011100… |
… | …1001001111101101001000000 |
3 | 1112222121110211101221200122010 |
4 | 1020303000321021331221000 |
5 | 313431040410230313422 |
6 | 3052533434311012520 |
7 | 124303105122215154 |
oct | 11063007111755100 |
9 | 1488543741850563 |
10 | 320165001026112 |
11 | 9301823a438650 |
12 | 2baaa15706a140 |
13 | 10985578a830c8 |
14 | 590c0d6855064 |
15 | 270335e23cb0c |
hex | 123303927da40 |
320165001026112 has 56 divisors (see below), whose sum is σ = 924112616604192. Its totient is φ = 97019697280000.
The previous prime is 320165001026107. The next prime is 320165001026119. The reversal of 320165001026112 is 211620100561023.
It is a self number, because there is not a number n which added to its sum of digits gives 320165001026112.
It is not an unprimeable number, because it can be changed into a prime (320165001026119) 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, 75796636389 + ... + 75796640612.
Almost surely, 2320165001026112 is an apocalyptic number.
320165001026112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
320165001026112 is an abundant number, since it is smaller than the sum of its proper divisors (603947615578080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
320165001026112 is a wasteful number, since it uses less digits than its factorization.
320165001026112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151593277027 (or 151593277017 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 320165001026112 its reverse (211620100561023), we get a palindrome (531785101587135).
The spelling of 320165001026112 in words is "three hundred twenty trillion, one hundred sixty-five billion, one million, twenty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •