Base | Representation |
---|---|
bin | 10101000111011101000… |
… | …101110001010001010111 |
3 | 12010201120120121020021021 |
4 | 111013131011301101113 |
5 | 142233334443143043 |
6 | 3030344321102011 |
7 | 206560640106124 |
oct | 25073505612127 |
9 | 5121516536237 |
10 | 1451113256023 |
11 | 50a46066a042 |
12 | 1b529aa87907 |
13 | a6abb1b9172 |
14 | 5033cb2974b |
15 | 27b306083ed |
hex | 151dd171457 |
1451113256023 has 8 divisors (see below), whose sum is σ = 1498130288640. Its totient is φ = 1404109156440.
The previous prime is 1451113255997. The next prime is 1451113256029. The reversal of 1451113256023 is 3206523111541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1451113256023 - 233 = 1442523321431 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1451113256023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1451113256029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3004963 + ... + 3454276.
It is an arithmetic number, because the mean of its divisors is an integer number (187266286080).
Almost surely, 21451113256023 is an apocalyptic number.
1451113256023 is a deficient number, since it is larger than the sum of its proper divisors (47017032617).
1451113256023 is an equidigital number, since it uses as much as digits as its factorization.
1451113256023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6466517.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 1451113256023 its reverse (3206523111541), we get a palindrome (4657636367564).
The spelling of 1451113256023 in words is "one trillion, four hundred fifty-one billion, one hundred thirteen million, two hundred fifty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •