Base | Representation |
---|---|
bin | 11101011101011010011… |
… | …01000111101100101100 |
3 | 10120202201120112221120220 |
4 | 32232231031013230230 |
5 | 113041013120243312 |
6 | 2053001532211340 |
7 | 133062556225413 |
oct | 16565515075454 |
9 | 3522646487526 |
10 | 1012223212332 |
11 | 360310684272 |
12 | 144213609b50 |
13 | 745b5753c67 |
14 | 36dc596a47a |
15 | 1b4e48c8c8c |
hex | ebad347b2c |
1012223212332 has 48 divisors (see below), whose sum is σ = 2471259098112. Its totient is φ = 321858408960.
The previous prime is 1012223212331. The next prime is 1012223212339. The reversal of 1012223212332 is 2332123222101.
It is not an unprimeable number, because it can be changed into a prime (1012223212331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4895269 + ... + 5097852.
It is an arithmetic number, because the mean of its divisors is an integer number (51484564544).
Almost surely, 21012223212332 is an apocalyptic number.
1012223212332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012223212332 is an abundant number, since it is smaller than the sum of its proper divisors (1459035885780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012223212332 is a wasteful number, since it uses less digits than its factorization.
1012223212332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9993518 (or 9993516 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1012223212332 its reverse (2332123222101), we get a palindrome (3344346434433).
The spelling of 1012223212332 in words is "one trillion, twelve billion, two hundred twenty-three million, two hundred twelve thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •