Base | Representation |
---|---|
bin | 101011010101101… |
… | …0101010101010111 |
3 | 10202100100000120212 |
4 | 1112223111111113 |
5 | 10434233401101 |
6 | 400144320035 |
7 | 51015332405 |
oct | 12653252527 |
9 | 3670300525 |
10 | 1454200151 |
11 | 686949108 |
12 | 34701301b |
13 | 1a2377881 |
14 | db1c0475 |
15 | 879ee1bb |
hex | 56ad5557 |
1454200151 has 4 divisors (see below), whose sum is σ = 1460550600. Its totient is φ = 1447849704.
The previous prime is 1454200147. The next prime is 1454200243. The reversal of 1454200151 is 1510024541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1510024541 = 17 ⋅88824973.
It is a cyclic number.
It is not a de Polignac number, because 1454200151 - 22 = 1454200147 is a prime.
It is a super-2 number, since 2×14542001512 = 4229396158336845602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1454200141) 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, 3174881 + ... + 3175338.
It is an arithmetic number, because the mean of its divisors is an integer number (365137650).
Almost surely, 21454200151 is an apocalyptic number.
1454200151 is a deficient number, since it is larger than the sum of its proper divisors (6350449).
1454200151 is an equidigital number, since it uses as much as digits as its factorization.
1454200151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6350448.
The product of its (nonzero) digits is 800, while the sum is 23.
The square root of 1454200151 is about 38133.9763334484. The cubic root of 1454200151 is about 1132.9430035775.
Adding to 1454200151 its reverse (1510024541), we get a palindrome (2964224692).
The spelling of 1454200151 in words is "one billion, four hundred fifty-four million, two hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •