Base | Representation |
---|---|
bin | 10101001010100000111… |
… | …111110010111001000011 |
3 | 12011001001122020100111102 |
4 | 111022200333302321003 |
5 | 142312102401233011 |
6 | 3032050412005015 |
7 | 210035250141335 |
oct | 25124077627103 |
9 | 5131048210442 |
10 | 1454400024131 |
11 | 51089799661a |
12 | 1b5a5776076b |
13 | a71c3117872 |
14 | 5057145d455 |
15 | 27c73e4573b |
hex | 152a0ff2e43 |
1454400024131 has 6 divisors (see below), whose sum is σ = 1472134042140. Its totient is φ = 1436877125468.
The previous prime is 1454400024107. The next prime is 1454400024137. The reversal of 1454400024131 is 1314200044541.
It is not a de Polignac number, because 1454400024131 - 26 = 1454400024067 is a prime.
It is a super-2 number, since 2×14544000241312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1454400024094 and 1454400024103.
It is not an unprimeable number, because it can be changed into a prime (1454400024137) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 105552701 + ... + 105566478.
It is an arithmetic number, because the mean of its divisors is an integer number (245355673690).
Almost surely, 21454400024131 is an apocalyptic number.
1454400024131 is a deficient number, since it is larger than the sum of its proper divisors (17734018009).
1454400024131 is an frugal number, since it uses more digits than its factorization.
1454400024131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211119345 (or 211119262 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 1454400024131 its reverse (1314200044541), we get a palindrome (2768600068672).
The spelling of 1454400024131 in words is "one trillion, four hundred fifty-four billion, four hundred million, twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •