Base | Representation |
---|---|
bin | 10001111010101001110… |
… | …101100010100011100011 |
3 | 11100200222010212222021210 |
4 | 101322221311202203203 |
5 | 130133004232000311 |
6 | 2341335435521203 |
7 | 154644350410020 |
oct | 21725165424343 |
9 | 4320863788253 |
10 | 1231210031331 |
11 | 435175a68615 |
12 | 17a7498b9203 |
13 | 8c144577177 |
14 | 4383b554547 |
15 | 2205eb823a6 |
hex | 11ea9d628e3 |
1231210031331 has 16 divisors (see below), whose sum is σ = 1876292812800. Its totient is φ = 703487373888.
The previous prime is 1231210031287. The next prime is 1231210031333. The reversal of 1231210031331 is 1331300121321.
It is a happy number.
It is not a de Polignac number, because 1231210031331 - 230 = 1230136289507 is a prime.
It is a super-2 number, since 2×12312100313312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1231210031298 and 1231210031307.
It is not an unprimeable number, because it can be changed into a prime (1231210031333) 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, 2302986 + ... + 2786783.
It is an arithmetic number, because the mean of its divisors is an integer number (117268300800).
Almost surely, 21231210031331 is an apocalyptic number.
1231210031331 is a deficient number, since it is larger than the sum of its proper divisors (645082781469).
1231210031331 is a wasteful number, since it uses less digits than its factorization.
1231210031331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5101298.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1231210031331 its reverse (1331300121321), we get a palindrome (2562510152652).
The spelling of 1231210031331 in words is "one trillion, two hundred thirty-one billion, two hundred ten million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •