Base | Representation |
---|---|
bin | 11011010101100111111001… |
… | …001111011110010101100100 |
3 | 120202201011220111210100200010 |
4 | 123111213321033132111210 |
5 | 111224400043440201012 |
6 | 1103414211533450220 |
7 | 34216363543631361 |
oct | 3325477117362544 |
9 | 522634814710603 |
10 | 120233201100132 |
11 | 3534568360333a |
12 | 11599bbb940970 |
13 | 5211c33076413 |
14 | 219946478d468 |
15 | dd781c76cc3c |
hex | 6d59f93de564 |
120233201100132 has 48 divisors (see below), whose sum is σ = 281165427087552. Its totient is φ = 39989044592640.
The previous prime is 120233201100119. The next prime is 120233201100163. The reversal of 120233201100132 is 231001102332021.
It is a junction number, because it is equal to n+sod(n) for n = 120233201100099 and 120233201100108.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10236643 + ... + 18581045.
It is an arithmetic number, because the mean of its divisors is an integer number (5857613064324).
Almost surely, 2120233201100132 is an apocalyptic number.
120233201100132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120233201100132 is an abundant number, since it is smaller than the sum of its proper divisors (160932225987420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120233201100132 is a wasteful number, since it uses less digits than its factorization.
120233201100132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8347068 (or 8347066 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 120233201100132 its reverse (231001102332021), we get a palindrome (351234303432153).
The spelling of 120233201100132 in words is "one hundred twenty trillion, two hundred thirty-three billion, two hundred one million, one hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •