Base | Representation |
---|---|
bin | 11110011011001000110… |
… | …100011111101010010111 |
3 | 21101212112002202112012020 |
4 | 132123020310133222113 |
5 | 233223300131411411 |
6 | 4240244240224223 |
7 | 304023033626553 |
oct | 36331064375227 |
9 | 7355462675166 |
10 | 2090723310231 |
11 | 736741892626 |
12 | 29924300b073 |
13 | 122201197a6a |
14 | 73297872863 |
15 | 395b7ad3606 |
hex | 1e6c8d1fa97 |
2090723310231 has 16 divisors (see below), whose sum is σ = 2888367361920. Its totient is φ = 1344338871200.
The previous prime is 2090723310211. The next prime is 2090723310251. The reversal of 2090723310231 is 1320133270902.
It is an interprime number because it is at equal distance from previous prime (2090723310211) and next prime (2090723310251).
It is a cyclic number.
It is not a de Polignac number, because 2090723310231 - 26 = 2090723310167 is a prime.
It is a super-2 number, since 2×20907233102312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2090723310192 and 2090723310201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2090723310211) 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, 111424545 + ... + 111443306.
It is an arithmetic number, because the mean of its divisors is an integer number (180522960120).
Almost surely, 22090723310231 is an apocalyptic number.
2090723310231 is a deficient number, since it is larger than the sum of its proper divisors (797644051689).
2090723310231 is a wasteful number, since it uses less digits than its factorization.
2090723310231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222867966.
The product of its (nonzero) digits is 13608, while the sum is 33.
The spelling of 2090723310231 in words is "two trillion, ninety billion, seven hundred twenty-three million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •