Base | Representation |
---|---|
bin | 11110000010101001100… |
… | …00110001110011110001 |
3 | 10122200022210011120022122 |
4 | 33001110300301303301 |
5 | 113402433320132423 |
6 | 2110105341044025 |
7 | 134401142065532 |
oct | 17012460616361 |
9 | 3580283146278 |
10 | 1032214224113 |
11 | 36883a024306 |
12 | 148072556615 |
13 | 76450302707 |
14 | 37d60992689 |
15 | 1bcb496b8c8 |
hex | f054c31cf1 |
1032214224113 has 32 divisors (see below), whose sum is σ = 1104860736000. Its totient is φ = 961555795200.
The previous prime is 1032214224101. The next prime is 1032214224127. The reversal of 1032214224113 is 3114224122301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1032214224113 - 212 = 1032214220017 is a prime.
It is a super-2 number, since 2×10322142241132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1032214224133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 182077643 + ... + 182083311.
It is an arithmetic number, because the mean of its divisors is an integer number (34526898000).
Almost surely, 21032214224113 is an apocalyptic number.
It is an amenable number.
1032214224113 is a deficient number, since it is larger than the sum of its proper divisors (72646511887).
1032214224113 is a wasteful number, since it uses less digits than its factorization.
1032214224113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6425.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1032214224113 its reverse (3114224122301), we get a palindrome (4146438346414).
The spelling of 1032214224113 in words is "one trillion, thirty-two billion, two hundred fourteen million, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •