Base | Representation |
---|---|
bin | 11011111110010110101011… |
… | …001011100000001110101100 |
3 | 121010121202122021001121110110 |
4 | 123332112223023200032230 |
5 | 112111224431242112302 |
6 | 1113400114514540020 |
7 | 34625532600660453 |
oct | 3376265313401654 |
9 | 533552567047413 |
10 | 123032210113452 |
11 | 36224738190962 |
12 | 11970572297610 |
13 | 5385b701846b3 |
14 | 2254b0db21b9a |
15 | e3553ba3bb6c |
hex | 6fe5ab2e03ac |
123032210113452 has 12 divisors (see below), whose sum is σ = 287075156931416. Its totient is φ = 41010736704480.
The previous prime is 123032210113411. The next prime is 123032210113517. The reversal of 123032210113452 is 254311012230321.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1230322101134522 (a number of 29 digits) contains 22 as substring.
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, 5126342088049 + ... + 5126342088072.
Almost surely, 2123032210113452 is an apocalyptic number.
123032210113452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
123032210113452 is an abundant number, since it is smaller than the sum of its proper divisors (164042946817964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123032210113452 is a wasteful number, since it uses less digits than its factorization.
123032210113452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10252684176128 (or 10252684176126 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 123032210113452 its reverse (254311012230321), we get a palindrome (377343222343773).
The spelling of 123032210113452 in words is "one hundred twenty-three trillion, thirty-two billion, two hundred ten million, one hundred thirteen thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •