Base | Representation |
---|---|
bin | 10101000111111101011… |
… | …100101110100111001011 |
3 | 12010202222102010212102120 |
4 | 111013331130232213023 |
5 | 142240442433122410 |
6 | 3030514233102323 |
7 | 206610251433633 |
oct | 25077534564713 |
9 | 5122872125376 |
10 | 1451656145355 |
11 | 50a70a05a909 |
12 | 1b54108579a3 |
13 | a6b76809c60 |
14 | 50390c876c3 |
15 | 27b630e4570 |
hex | 151fd72e9cb |
1451656145355 has 64 divisors (see below), whose sum is σ = 2586871848960. Its totient is φ = 690601706496.
The previous prime is 1451656145309. The next prime is 1451656145441. The reversal of 1451656145355 is 5535416561541.
It is not a de Polignac number, because 1451656145355 - 211 = 1451656143307 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1451656145298 and 1451656145307.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 278442 + ... + 1726511.
It is an arithmetic number, because the mean of its divisors is an integer number (40419872640).
Almost surely, 21451656145355 is an apocalyptic number.
1451656145355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1451656145355 is a deficient number, since it is larger than the sum of its proper divisors (1135215703605).
1451656145355 is a wasteful number, since it uses less digits than its factorization.
1451656145355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005100.
The product of its digits is 5400000, while the sum is 51.
The spelling of 1451656145355 in words is "one trillion, four hundred fifty-one billion, six hundred fifty-six million, one hundred forty-five thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •