Base | Representation |
---|---|
bin | 11101011011101110110… |
… | …00100001110000101010 |
3 | 10120200101122102211211000 |
4 | 32231313120201300222 |
5 | 113032140434424002 |
6 | 2052332154215430 |
7 | 133031313100542 |
oct | 16556730416052 |
9 | 3520348384730 |
10 | 1011320233002 |
11 | 35a9979a7562 |
12 | 144001124576 |
13 | 744a0656471 |
14 | 36d3ba76322 |
15 | 1b4904ae61c |
hex | eb77621c2a |
1011320233002 has 32 divisors (see below), whose sum is σ = 2295194860800. Its totient is φ = 329934259584.
The previous prime is 1011320232991. The next prime is 1011320233003. The reversal of 1011320233002 is 2003320231101.
1011320233002 is a `hidden beast` number, since 1 + 0 + 11 + 320 + 2 + 330 + 0 + 2 = 666.
It is a super-2 number, since 2×10113202330022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1011320233003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 199233127 + ... + 199238202.
It is an arithmetic number, because the mean of its divisors is an integer number (71724839400).
Almost surely, 21011320233002 is an apocalyptic number.
1011320233002 is an abundant number, since it is smaller than the sum of its proper divisors (1283874627798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011320233002 is a wasteful number, since it uses less digits than its factorization.
1011320233002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398471387 (or 398471381 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1011320233002 its reverse (2003320231101), we get a palindrome (3014640464103).
The spelling of 1011320233002 in words is "one trillion, eleven billion, three hundred twenty million, two hundred thirty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •