Base | Representation |
---|---|
bin | 1110010011101000111001… |
… | …11101010011110101000001 |
3 | 11010101122122122011010221012 |
4 | 13021310130331103311001 |
5 | 13110424334021332444 |
6 | 150525012315010305 |
7 | 6424663625335646 |
oct | 711643475236501 |
9 | 133348578133835 |
10 | 31461121277249 |
11 | a02a64a853614 |
12 | 3641461a39995 |
13 | 1472a03b93861 |
14 | 7aaa25325dcd |
15 | 398598d26b9e |
hex | 1c9d1cf53d41 |
31461121277249 has 4 divisors (see below), whose sum is σ = 31493522021040. Its totient is φ = 31428720533460.
The previous prime is 31461121277237. The next prime is 31461121277279. The reversal of 31461121277249 is 94277212116413.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31461121277249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31461121277197 and 31461121277206.
It is not an unprimeable number, because it can be changed into a prime (31461121277279) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16200370439 + ... + 16200372380.
It is an arithmetic number, because the mean of its divisors is an integer number (7873380505260).
Almost surely, 231461121277249 is an apocalyptic number.
It is an amenable number.
31461121277249 is a deficient number, since it is larger than the sum of its proper divisors (32400743791).
31461121277249 is an equidigital number, since it uses as much as digits as its factorization.
31461121277249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32400743790.
The product of its digits is 1016064, while the sum is 50.
The spelling of 31461121277249 in words is "thirty-one trillion, four hundred sixty-one billion, one hundred twenty-one million, two hundred seventy-seven thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •