Base | Representation |
---|---|
bin | 11110000010101011101… |
… | …01011001101000010100 |
3 | 10122200101001000111110011 |
4 | 33001111311121220110 |
5 | 113403002421304022 |
6 | 2110111222410004 |
7 | 134401451020360 |
oct | 17012565315024 |
9 | 3580331014404 |
10 | 1032232213012 |
11 | 3688491a0670 |
12 | 148078590904 |
13 | 76453c60630 |
14 | 37d631162a0 |
15 | 1bcb6321977 |
hex | f055d59a14 |
1032232213012 has 48 divisors (see below), whose sum is σ = 2425384789632. Its totient is φ = 371232362880.
The previous prime is 1032232212953. The next prime is 1032232213039. The reversal of 1032232213012 is 2103122322301.
It is a super-2 number, since 2×10322322130122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 128896123 + ... + 128904130.
It is an arithmetic number, because the mean of its divisors is an integer number (50528849784).
Almost surely, 21032232213012 is an apocalyptic number.
It is an amenable number.
1032232213012 is an abundant number, since it is smaller than the sum of its proper divisors (1393152576620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032232213012 is a wasteful number, since it uses less digits than its factorization.
1032232213012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257800288 (or 257800286 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1032232213012 its reverse (2103122322301), we get a palindrome (3135354535313).
The spelling of 1032232213012 in words is "one trillion, thirty-two billion, two hundred thirty-two million, two hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •