Base | Representation |
---|---|
bin | 101011011011000… |
… | …0011111000000111 |
3 | 10202112121220000222 |
4 | 1112312003320013 |
5 | 10440443342411 |
6 | 400324454555 |
7 | 51051254033 |
oct | 12666037007 |
9 | 3675556028 |
10 | 1457012231 |
11 | 688499944 |
12 | 347b4a45b |
13 | 1a2b2081c |
14 | db7131c3 |
15 | 87da74db |
hex | 56d83e07 |
1457012231 has 4 divisors (see below), whose sum is σ = 1457436432. Its totient is φ = 1456588032.
The previous prime is 1457012153. The next prime is 1457012237. The reversal of 1457012231 is 1322107541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1457012231 - 210 = 1457011207 is a prime.
It is a super-2 number, since 2×14570122312 = 4245769282567194722, which contains 22 as substring.
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 1457012231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1457012237) 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, 206906 + ... + 213831.
It is an arithmetic number, because the mean of its divisors is an integer number (364359108).
Almost surely, 21457012231 is an apocalyptic number.
1457012231 is a deficient number, since it is larger than the sum of its proper divisors (424201).
1457012231 is an equidigital number, since it uses as much as digits as its factorization.
1457012231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424200.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 1457012231 is about 38170.8295822870. The cubic root of 1457012231 is about 1133.6728148424.
Adding to 1457012231 its reverse (1322107541), we get a palindrome (2779119772).
The spelling of 1457012231 in words is "one billion, four hundred fifty-seven million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •