Base | Representation |
---|---|
bin | 110001011000000010… |
… | …0010111110010110000 |
3 | 101010200122002011202101 |
4 | 1202300010113302300 |
5 | 3214123441314102 |
6 | 120413322230144 |
7 | 10442412625315 |
oct | 1426004276260 |
9 | 333618064671 |
10 | 106033151152 |
11 | 40a71a49935 |
12 | 18672355354 |
13 | 9cca714876 |
14 | 51bc41cd0c |
15 | 2b58c1ee87 |
hex | 18b0117cb0 |
106033151152 has 20 divisors (see below), whose sum is σ = 205915900896. Its totient is φ = 52893563840.
The previous prime is 106033151141. The next prime is 106033151177. The reversal of 106033151152 is 251151330601.
It is a super-2 number, since 2×1060331511522 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106033151152.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7681123 + ... + 7694914.
Almost surely, 2106033151152 is an apocalyptic number.
It is an amenable number.
106033151152 is a deficient number, since it is larger than the sum of its proper divisors (99882749744).
106033151152 is a wasteful number, since it uses less digits than its factorization.
106033151152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15376476 (or 15376470 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 106033151152 its reverse (251151330601), we get a palindrome (357184481753).
The spelling of 106033151152 in words is "one hundred six billion, thirty-three million, one hundred fifty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •