Base | Representation |
---|---|
bin | 100100011001101… |
… | …1110000100010111 |
3 | 10011010101012020000 |
4 | 1020303132010113 |
5 | 10000142431210 |
6 | 321111542343 |
7 | 42161112465 |
oct | 11063360427 |
9 | 3133335200 |
10 | 1221452055 |
11 | 57752900a |
12 | 2a108a9b3 |
13 | 1660957c5 |
14 | b8315835 |
15 | 72376ac0 |
hex | 48cde117 |
1221452055 has 40 divisors (see below), whose sum is σ = 2197509072. Its totient is φ = 649078272.
The previous prime is 1221452047. The next prime is 1221452059. The reversal of 1221452055 is 5502541221.
1221452055 is a `hidden beast` number, since 122 + 14 + 520 + 5 + 5 = 666.
It is not a de Polignac number, because 1221452055 - 23 = 1221452047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221452059) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 109287 + ... + 119943.
Almost surely, 21221452055 is an apocalyptic number.
1221452055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1221452055 is a deficient number, since it is larger than the sum of its proper divisors (976057017).
1221452055 is a wasteful number, since it uses less digits than its factorization.
1221452055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10957 (or 10948 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The square root of 1221452055 is about 34949.2783187293. The cubic root of 1221452055 is about 1068.9534866468.
Adding to 1221452055 its reverse (5502541221), we get a palindrome (6723993276).
It can be divided in two parts, 1221 and 452055, that multiplied together give a palindrome (551959155).
The spelling of 1221452055 in words is "one billion, two hundred twenty-one million, four hundred fifty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •