Base | Representation |
---|---|
bin | 10000011101100001010… |
… | …111101111001011000011 |
3 | 11000010211222012121121100 |
4 | 100131201113233023003 |
5 | 122013204230330311 |
6 | 2223400512225443 |
7 | 144504303306141 |
oct | 20354127571303 |
9 | 4003758177540 |
10 | 1131210011331 |
11 | 3a681a619494 |
12 | 16329bb3b283 |
13 | 82898a5b5ba |
14 | 3ca724ca591 |
15 | 1e65a941a56 |
hex | 107615ef2c3 |
1131210011331 has 12 divisors (see below), whose sum is σ = 1633980282480. Its totient is φ = 754135269360.
The previous prime is 1131210011317. The next prime is 1131210011357. The reversal of 1131210011331 is 1331100121311.
1131210011331 is a `hidden beast` number, since 1 + 1 + 312 + 10 + 0 + 11 + 331 = 666.
It is not a de Polignac number, because 1131210011331 - 25 = 1131210011299 is a prime.
It is a super-3 number, since 3×11312100113313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (1131210011431) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1704850 + ... + 2273528.
It is an arithmetic number, because the mean of its divisors is an integer number (136165023540).
Almost surely, 21131210011331 is an apocalyptic number.
1131210011331 is a deficient number, since it is larger than the sum of its proper divisors (502770271149).
1131210011331 is a wasteful number, since it uses less digits than its factorization.
1131210011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789706 (or 789703 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 1131210011331 its reverse (1331100121311), we get a palindrome (2462310132642).
The spelling of 1131210011331 in words is "one trillion, one hundred thirty-one billion, two hundred ten million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •